Name
Abstract | ||
|---|---|---|
Distance-preserving maps (DPMs) from binary vectors to permutations are useful for the construction of permutation arrays. A new construction of DPMs is presented. We study the distance increasing property of the new DPMs that this construction yields. Then we show that new DPMs contain a class of nicely structured DPMs of even length with good distance increasing property |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TIT.2005.858990 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
distance-preserving maps (dpms),cyclic codes,binary sequences,construction yield,new construction,distance-preserving map,hamming distance,cyclic construction,permutation arrays,hamming codes,binary vector,binary codes,dpm,permutation array,vectors,good distance,new dpms | Information theory,Discrete mathematics,Hamming code,Combinatorics,Computer science,Binary code,Permutation,Hamming distance,Binary number | Journal |
Volume | Issue | ISSN |
51 | 12 | 0018-9448 |
Citations | PageRank | References |
7 | 0.73 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kwankyu Lee | 1 | 117 | 11.76 |