New Lower Bounds for Permutation Codes Using Linear Block Codes

DOI10.1109/TIT.2019.2957354MaRDI QIDQ5124412zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an $[n,k,d{]}_q$ linear block code, we are able to prove the existence of a permutation code in the symmetric group of degree $n$, having minimum distance at least $d$ and large cardinality. With our technique, we obtain new lower bounds for permutation codes that enhance the ones in the literature and provide asymptotic improvements in certain regimes of length and distance of the permutation code.

Cited in

(6)

• Using permutation rational functions to obtain permutation arrays with large Hamming distance
• Improved lower bounds for permutation arrays using permutation rational functions
• Multiple contractions of permutation arrays
• Submodule codes as spherical codes in buildings
• New upper bounds for the size of permutation codes via linear programming
• Upper bounds on the size of permutation codes with a Hamming distance of five

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124412)