On additive MDS codes over small fields
From MaRDI portal
Publication:6167300
DOI10.3934/AMC.2021024zbMATH Open1517.94206arXiv2012.06183OpenAlexW3178595420MaRDI QIDQ6167300FDOQ6167300
Authors: Simeon Ball, Guillermo Gamboa, Michel Lavrauw
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: Let be a additive MDS code which is linear over . We prove that if and of the projections of are linear over then is linear over . We use this geometrical theorem, other geometric arguments and some computations to classify all additive MDS codes over for . We also classify the longest additive MDS codes over which are linear over . In these cases, the classifications not only verify the MDS conjecture for additive codes, but also confirm there are no additive non-linear MDS codes which perform as well as their linear counterparts. These results imply that the quantum MDS conjecture holds for .
Full work available at URL: https://arxiv.org/abs/2012.06183
Recommendations
- Near-MDS codes over some small fields
- Constructions of Partial MDS Codes Over Small Fields
- On \(m\)-MDS codes over finite fields
- Sparse and Balanced MDS Codes Over Small Fields
- Constacyclic additive codes over finite fields
- Multi-twisted additive codes over finite fields
- On additive MDS codes with linear projections
- Classification of MDS codes over small alphabets
- Additive skew \(G\)-codes over finite fields
- Multi-twisted additive codes with complementary duals over finite fields
Cites Work
- Field reduction and linear sets in finite geometry
- Orthogonal Arrays of Index Unity
- Characters and the equivalence of codes
- Nonbinary Stabilizer Codes Over Finite Fields
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Title not available (Why is that?)
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- (6,3)-MDS codes over an alphabet of size 4
- On the Classification of MDS Codes
- Further results on the classification of MDS codes
- Title not available (Why is that?)
- Note on MDS codes over the integers modulo \(p^m\)
- Small additive quaternary codes.
- Finding the smallest image of a set
- Arcs in finite projective spaces
Cited In (10)
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- On the theory of \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- On additive MDS codes with linear projections
- An algebraic-coding equivalence to the maximum distance separable conjecture
- The equivalence of linear codes implies semi-linear equivalence
- Some new classes of additive MDS and almost MDS codes over finite fields
- Constructions of Partial MDS Codes Over Small Fields
- Theory of additive complementary dual codes, constructions and computations
- Near-MDS codes over some small fields
- Some new constructions of optimal and almost optimal locally repairable codes
This page was built for publication: On additive MDS codes over small fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167300)