5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.IT2009★ 5 cited
Permutation Arrays Under the Chebyshev Distance
Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai +1
An (n,d) permutation array (PA) is a set of permutations of length n with the property that the distance (under some metric) between any two permutations in the array is at least d…
cs.DM2007★ 1 cited
Distance preserving mappings from ternary vectors to permutations
Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen +1
Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two dis…