New Lower Bounds for Permutation Codes Using Linear Block Codes

DOI10.1109/TIT.2019.2957354zbMath1446.94199arXiv1901.08858OpenAlexW2994269808MaRDI 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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (4)

Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ Multiple contractions of permutation arrays ⋮ Submodule codes as spherical codes in buildings ⋮ Improved lower bounds for permutation arrays using permutation rational functions

This page was built for publication: New Lower Bounds for Permutation Codes Using Linear Block Codes