On the Classification of MDS Codes

DOI10.1109/TIT.2015.2488659MaRDI QIDQ2977156zbMATH OpenOpenAlexFDO

Authors Janne I. Kokkala, Patric R. J. Östergård, Denis S. Krotov

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.5822

Mathematics Subject Classification ID

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

Abstract: A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d{)}_q$ code. An $(n,q^k,n-k+1{)}_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified. It is shown that every $(k+d-1,q^k,d{)}_q$ code with $kgeq3$, $dgeq3$, $qin5,7$ is equivalent to a linear code with the same parameters. This implies that the $(6,5^4,3{)}_5$ code and the $(n,7^{n-2},3{)}_7$ MDS codes for $nin6,7,8$ are unique. The classification of one-error-correcting $8$-ary MDS codes is also finished; there are $14$, $8$, $4$, and $4$ equivalence classes of $(n,8^{n-2},3{)}_8$ codes for $n=6,7,8,9$, respectively. One of the equivalence classes of perfect $(9,8^7,3{)}_8$ codes corresponds to the Hamming code and the other three are nonlinear codes for which there exists no previously known construction.

Cited in

(20)

• Comparing healthcare utilization patterns via global differences in the endorsement of current procedural terminology codes
• A note on the constructions of MDS self-dual codes
• MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
• On robust colorings of Hamming-distance graphs
• On the non-existence of extended 1-perfect codes and MDS codes
• The equivalence of linear codes implies semi-linear equivalence
• A class of twisted generalized Reed-Solomon codes
• MDS and near-MDS codes via twisted Reed-Solomon codes
• MDS codes in Doob graphs
• Construction of MDS self-dual codes over finite fields
• Some new constructions of MDS self-dual codes over finite fields
• Further results on the classification of MDS codes
• New MDS or Near-MDS Self-Dual Codes
• Optimal quantum error correcting codes from absolutely maximally entangled states
• Constructions of transitive Latin hypercubeatin hypercubes
• Projective tilings and full-rank perfect codes
• On additive MDS codes over small fields
• Perfect 2‐colorings of Hamming graphs
• MDS codes with \(l\)-Galois hulls of arbitrary dimensions
• Two families of linear codes containing non-GRS MDS codes

This page was built for publication: On the Classification of MDS Codes

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