New Lower Bounds for Permutation Codes Using Linear Block Codes
From MaRDI portal
Publication:5124412
DOI10.1109/TIT.2019.2957354zbMath1446.94199arXiv1901.08858MaRDI QIDQ5124412
Giacomo Micheli, Alessandro Neri
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.08858
Related Items
Multiple contractions of permutation arrays, Submodule codes as spherical codes in buildings, Using permutation rational functions to obtain permutation arrays with large Hamming distance, Improved lower bounds for permutation arrays using permutation rational functions