Classification of MDS codes over small alphabets
From MaRDI portal
Publication:3460469
DOI10.1007/978-3-319-17296-5_24zbMATH Open1398.94218OpenAlexW2263600577MaRDI QIDQ3460469FDOQ3460469
Authors: Janne I. Kokkala, Patric R. J. Östergård, Denis S. Krotov 
Publication date: 7 January 2016
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_24
Recommendations
Cites Work
- Practical graph isomorphism. II.
- Title not available (Why is that?)
- Maximum distance<tex>q</tex>-nary codes
- 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
- Classification of Graeco-Latin Cubes
- On perfect \(p\)-ary codes of length \(p+1\)
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- On Group and Nongroup Perfect Codes in $q$ Symbols.
- Extending MDS codes
Cited In (10)
- (6,3)-MDS codes over an alphabet of size 4
- Title not available (Why is that?)
- On additive MDS codes with linear projections
- New MDS self-dual codes over finite fields of odd characteristic
- Title not available (Why is that?)
- Characterization of some minimal codes for secret sharing
- Further results on the classification of MDS codes
- On additive MDS codes over small fields
- Title not available (Why is that?)
- MDS codes over \(\mathbb{F}_9\) related to the ternary Golay code
Uses Software
This page was built for publication: Classification of MDS codes over small alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460469)
