Distance-preserving mappings from binary vectors to permutations

DOI10.1109/TIT.2003.809507zbMath1063.94105OpenAlexW2135964784MaRDI QIDQ4680074

Torleiv Kløve, Rong-Jaye Chen, Jen-Chun Chang, 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)

Related Items (10)

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 ⋮ Computing the ball size of frequency permutations under Chebyshev distance ⋮ Decoding permutation arrays with ternary vectors ⋮ Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency ⋮ New algorithms of distance-increasing mappings from binary vectors to permutations by swaps ⋮ On constant composition codes ⋮ The \(r\)-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations ⋮ Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes ⋮ Modified linear block code with code rate 1/2 and less than 1/2

This page was built for publication: Distance-preserving mappings from binary vectors to permutations