On additive MDS codes over small fields
From MaRDI portal
Publication:6167300
DOI10.3934/amc.2021024zbMath1517.94206arXiv2012.06183OpenAlexW3178595420MaRDI QIDQ6167300
Guillermo Gamboa, Michel Lavrauw, Simeon Ball
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06183
Related Items (5)
The equivalence of linear codes implies semi-linear equivalence ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Theory of additive complementary dual codes, constructions and computations ⋮ On additive MDS codes with linear projections ⋮ Some new classes of additive MDS and almost MDS codes over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Further results on the classification of MDS codes
- Finite geometries.
- Small additive quaternary codes.
- Characters and the equivalence of codes
- Note on MDS codes over the integers modulo \(p^m\)
- Arcs in finite projective spaces
- 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
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- On the Classification of MDS Codes
- Field reduction and linear sets in finite geometry
- Nonbinary Stabilizer Codes Over Finite Fields
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Finding the smallest image of a set
- Orthogonal Arrays of Index Unity
This page was built for publication: On additive MDS codes over small fields