Distance-increasing mappings from binary vectors to permutations
From MaRDI portal
Publication:3546669
DOI10.1109/TIT.2004.839527zbMath1294.94109MaRDI QIDQ3546669
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
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 ⋮ 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 ⋮ The \(r\)-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations ⋮ Modified linear block code with code rate 1/2 and less than 1/2
