A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
From MaRDI portal
Publication:3548072
DOI10.1109/TIT.2006.878175zbMATH Open1309.94191MaRDI QIDQ3548072FDOQ3548072
Authors: Theo G. Swart, Hendrik C. Ferreira 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Distance-preserving mappings from binary vectors to permutations
- Distance-increasing mappings from binary vectors to permutations
- New Distance-Preserving Maps of Odd Length
- Cyclic Constructions of Distance-Preserving Maps
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
Cited In (4)
- New distance concept and graph theory approach for certain coding techniques design and analysis
- Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
- New Distance-Preserving Maps of Odd Length
- Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency
This page was built for publication: A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548072)
