New simple constructions of distance-increasing mappings from binary vectors to permutations

DOI10.1016/J.IPL.2005.09.019MaRDI QIDQ845836zbMATH OpenOpenAlexFDO

Authors Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.09.019

zbMATH Keywords

Hamming distancecombinatorial problemspermutation arraysdistance-preserving mappingsdistance-increasing mappings

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• 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
• New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
• Distance-increasing mappings from binary vectors to permutations
• Distance-preserving mappings from binary vectors to permutations

Cites work

• Constructions of permutation arrays
• Distance-increasing mappings from binary vectors to permutations
• Distance-preserving mappings from binary vectors to permutations
• New Distance-Preserving Maps of Odd Length
• Two Constructions of Permutation Arrays

Cited in

(4)

• 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
• Distance-increasing mappings from binary vectors to permutations
• Distance-increasing maps of all lengths by simple mapping algorithms

This page was built for publication: New simple constructions of distance-increasing 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 Q845836)