Constructing constant composition codes via distance-increasing mappings

DOI10.1137/11083040XzbMATH Open1255.94089OpenAlexW2059083110MaRDI QIDQ2902907FDOQ2902907

Authors: Hsin-Lung Wu, Jen-Chun Chang 

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/11083040x

Recommendations

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

zbMATH Keywords

constant composition codesdistance-preserving mappingsdistance-increasing mappings

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25)

Cited In (1)

• Equidistant frequency permutation arrays and related constant composition codes

This page was built for publication: Constructing constant composition codes via distance-increasing mappings

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