Distance-preserving mappings from binary vectors to permutations

DOI10.1109/TIT.2003.809507MaRDI QIDQ4680074zbMATH OpenOpenAlexFDO

Authors Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve, Shi-Chun Tsai

Publication date 1 June 2005

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

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• Distance-increasing mappings from binary vectors to permutations
• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
• Distance-increasing maps of all lengths by simple mapping algorithms

Cited in

(20)

• Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
• The \(r\)-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations
• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• On constant composition codes
• Constructing constant composition codes via distance-increasing mappings
• Distance-increasing mappings from binary vectors to permutations
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
• New Distance-Preserving Maps of Odd Length
• Cyclic Constructions of Distance-Preserving Maps
• Distance-increasing maps of all lengths by simple mapping algorithms
• A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
• Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
• Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
• Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
• Computing the ball size of frequency permutations under Chebyshev distance
• Modified linear block code with code rate 1/2 and less than 1/2
• Decoding permutation arrays with ternary vectors
• Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency
• New simple constructions of distance-increasing 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 mappings from binary vectors to permutations

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