Name
Abstract | ||
|---|---|---|
Distance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even lengths is known, existing DIMs of odd lengths are defined either by recursively merging DIMs of shorter lengths or by complicated mapping algorithms. In this paper, simple mapping algorithms defining DIMs of all lengths are presented |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/TIT.2006.876200 | Clinical Orthopaedics and Related Research |
Keywords | DocType | Volume |
shorter length,odd length,dim,distance-increasing maps (dims),distance-increasing map,simple mapping,mapping algorithm,hamming distance,information theory,permutation arrays,complicated mapping algorithm,binary vector,simple mapping algorithm,permutation array,distance-preserving maps,mathematics,statistics,merging,binary codes | Journal | 52 |
Issue | ISSN | Citations |
7 | 0018-9448 | 8 |
PageRank | References | Authors |
0.69 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kwankyu Lee | 1 | 117 | 11.76 |