(6,3)-MDS codes over an alphabet of size 4
From MaRDI portal
Publication:2491256
DOI10.1007/S10623-004-5659-4zbMATH Open1142.94390OpenAlexW2028612572MaRDI QIDQ2491256FDOQ2491256
Authors: Tim L. Alderson
Publication date: 29 May 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-5659-4
Recommendations
Cites Work
Cited In (9)
- On the non-existence of extended 1-perfect codes and MDS codes
- Extending MDS codes
- The equivalence of linear codes implies semi-linear equivalence
- Further results on the classification of MDS codes
- Classification of Graeco-Latin Cubes
- Classification of MDS codes over small alphabets
- On additive MDS codes over small fields
- MDS codes in Doob graphs
- On non-full-rank perfect codes over finite fields
This page was built for publication: (6,3)-MDS codes over an alphabet of size 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491256)