Further results on the classification of MDS codes
From MaRDI portal
Publication:326328
DOI10.3934/amc.2016020zbMath1348.94097arXiv1504.06982OpenAlexW2963087706MaRDI QIDQ326328
Patric R. J. Östergård, Janne I. Kokkala
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06982
Related Items
On the non-existence of extended 1-perfect codes and MDS codes ⋮ The equivalence of linear codes implies semi-linear equivalence ⋮ On additive MDS codes with linear projections ⋮ On additive MDS codes over small fields ⋮ MDS codes in Doob graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On connection between reducibility of an \(n\)-ary quasigroup and that of its retracts.
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Classification algorithms for codes and designs
- On the maximality of linear codes
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Practical graph isomorphism. II.
- (6,3)-MDS codes over an alphabet of size 4
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Maximum distance separable codes and arcs in projective spaces
- Enumeration of MOLS of small order
- On the Classification of MDS Codes
- Small latin squares, quasigroups, and loops
- A Census of Small Latin Hypercubes
- Atomic Latin squares of order eleven
- Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)
- Classification of Graeco-Latin Cubes
