Distance-increasing maps of all lengths by simple mapping algorithms

DOI10.1109/TIT.2006.876200MaRDI QIDQ3547089zbMATH OpenOpenAlexFDO

Authors Kwankyu Lee

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication theory (94A05) Source coding (94A29)

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 length is known, existing DIMs of odd length are either recursively constructed by merging shorter DIMs or defined by much complicated mapping algorithms. In this paper, DIMs of all length defined by simple mapping algorithms are presented.

Recommendations

• New simple constructions of distance-increasing mappings from binary vectors to permutations
• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• Distance-increasing mappings from binary vectors to permutations
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
• Distance-preserving mappings from binary vectors to permutations

Cited in

(5)

• Distance-increasing mappings from binary vectors to permutations
• New Distance-Preserving Maps of Odd Length
• Cyclic Constructions of Distance-Preserving Maps
• Distance-preserving mappings from binary vectors to permutations
• New simple constructions of distance-increasing mappings from binary vectors to permutations

This page was built for publication: Distance-increasing maps of all lengths by simple mapping algorithms

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