Simple Distance-Preserving Mappings From Ternary Vectors to Permutations

DOI10.1109/TIT.2008.924716MaRDI QIDQ3604695zbMATH OpenOpenAlexFDO

Authors Te-Tsung Lin, Shi-Chun Tsai, Hsin-Lung Wu

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.924716

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
• Distance-preserving mappings from binary vectors to permutations
• Cyclic Constructions of Distance-Preserving Maps
• Distance-increasing mappings from binary vectors to permutations
• A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings

Cited in

(6)

• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
• Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
• Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
• Decoding permutation arrays with ternary vectors
• On the construction of permutation arrays via mappings from binary vectors to permutations

This page was built for publication: Simple Distance-Preserving Mappings From Ternary Vectors to Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604695)