Abstract | ||
---|---|---|
We propose a new construction of maps preserving the Hamming distance from the set of binary vectors of odd length to the set of permutations of the same length. We investigate their distance increasing property, and show that a class of new maps have better distance increasing property than previously known maps of equal length. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1109/TIT.2004.834742 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
dpms,new distance-preserving map,odd length,equal length,binary sequences,new construction,better distance,distance-preserving map,new map,hamming distance,permutation arrays,binary vector,permutation array,distance-preserving maps | Information theory,Discrete mathematics,Combinatorics,Permutation,Binary code,Hamming distance,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
50 | 10 | 0018-9448 |
Citations | PageRank | References |
19 | 2.69 | 1 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kwankyu Lee | 1 | 117 | 11.76 |