TY - GEN
T1 - A multilevel construction for mappings from binary sequences to permutation sequences
AU - Swart, Theo G.
AU - Ferreira, Hendrik C.
PY - 2006
Y1 - 2006
N2 - A multilevel construction is introduced to create distance-preserving mappings from binary sequences to permutation sequences. It is also shown that for certain values, the new mappings attain the upper bound on the sum of Hamming distances obtainable for such mappings, and in the other cases improve on those of previous mappings.
AB - A multilevel construction is introduced to create distance-preserving mappings from binary sequences to permutation sequences. It is also shown that for certain values, the new mappings attain the upper bound on the sum of Hamming distances obtainable for such mappings, and in the other cases improve on those of previous mappings.
UR - http://www.scopus.com/inward/record.url?scp=39049129310&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.261810
DO - 10.1109/ISIT.2006.261810
M3 - Conference contribution
AN - SCOPUS:39049129310
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1895
EP - 1899
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Y2 - 9 July 2006 through 14 July 2006
ER -