New algorithms of distance-increasing mappings from binary vectors to permutations by swaps

DOI10.1007/s10623-005-5246-3zbMath1172.68559OpenAlexW1994363254MaRDI QIDQ2491311

Jen-Chun Chang

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-5246-3

zbMATH Keywords

AlgorithmsHamming distanceCode constructionsDistance-increasing mappings (DIMs)Permutation arrays (PAs)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cites Work

• Distance-increasing mappings from binary vectors to permutations
• New Distance-Preserving Maps of Odd Length
• Distance-preserving mappings from binary vectors to permutations

This page was built for publication: New algorithms of distance-increasing mappings from binary vectors to permutations by swaps