Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations

DOI10.1109/TIT.2007.915706MaRDI QIDQ3604711zbMATH OpenFDO

Authors Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve

Publication date 24 February 2009

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

Full work available at URL https://arxiv.org/abs/0704.1358

zbMATH Keywords

Distance-increasing mappingsdistance-preserving mappingspermutation arrayspowerline communication

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25)

Abstract: Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. In this paper, we propose a construction of DPMs from ternary vectors. The constructed DPMs improve the lower bounds on the maximal size of permutation arrays.

Recommendations

• Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
• Distance-increasing mappings from binary vectors to permutations
• Distance-preserving mappings from binary vectors to permutations
• Cyclic Constructions of Distance-Preserving Maps
• On the construction of permutation arrays via mappings from binary vectors to permutations

Cited in

(8)

• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• Constructing constant composition codes via distance-increasing mappings
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
• Cyclic Constructions of Distance-Preserving Maps
• Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
• Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
• Distance-preserving mappings from binary vectors to permutations
• On the construction of permutation arrays via mappings from binary vectors to permutations

This page was built for publication: Distance-Preserving and Distance-Increasing 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 Q3604711)