On the Classification of MDS Codes
From MaRDI portal
Publication:2977156
DOI10.1109/TIT.2015.2488659zbMath1359.94805arXiv1411.5822OpenAlexW3100027604MaRDI QIDQ2977156
Patric R. J. Östergård, Janne I. Kokkala, 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
Related Items (16)
On the non-existence of extended 1-perfect codes and MDS codes ⋮ Further results on the classification of 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 ⋮ Some new constructions of MDS self-dual codes over finite fields ⋮ Projective tilings and full-rank perfect codes ⋮ On additive MDS codes over small fields ⋮ Perfect 2‐colorings of Hamming graphs ⋮ Optimal quantum error correcting codes from absolutely maximally entangled states ⋮ 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 ⋮ MDS codes in Doob graphs ⋮ Constructions of transitive Latin hypercubeatin hypercubes ⋮ Construction of MDS self-dual codes over finite fields
This page was built for publication: On the Classification of MDS Codes
