Two Constructions of Permutation Arrays
From MaRDI portal
Publication:3546483
DOI10.1109/TIT.2004.826659zbMath1282.94021OpenAlexW2147394417MaRDI QIDQ3546483
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.826659
Permutations, words, matrices (05A05) Modulation and demodulation in information and communication theory (94A14) Source coding (94A29)
Related Items (7)
Complete weight enumerators of some linear codes and their applications ⋮ 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 ⋮ A random construction for permutation codes and the covering radius ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
This page was built for publication: Two Constructions of Permutation Arrays
