New simple constructions of distance-increasing mappings from binary vectors to permutations
From MaRDI portal
Publication:845836
DOI10.1016/J.IPL.2005.09.019zbMATH Open1185.68455OpenAlexW2122656244MaRDI QIDQ845836FDOQ845836
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
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
Hamming distancecombinatorial problemspermutation arraysdistance-preserving mappingsdistance-increasing mappings
Cites Work
Cited In (4)
- Distance-increasing mappings from binary vectors to permutations
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
- Distance-increasing maps of all lengths by simple mapping algorithms
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
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)