Further results on the classification of MDS codes

DOI10.3934/AMC.2016020MaRDI QIDQ326328zbMATH OpenOpenAlexFDO

Authors Janne I. Kokkala, Patric R. J. Östergård

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

zbMATH Keywords

classificationLatin hypercubeMDS code

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)

Abstract: A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $mathcalA$ of size $q$ is a set of $q^k$ codewords that are elements of $mathcal{A}^n$, such that the Hamming distance between two distinct codewords in $C$ is at least $n-k+1$. Sets of mutually orthogonal Latin squares of orders $qleq9$, corresponding to two-dimensional mbox{$q$-}ary MDS codes, and $q$-ary one-error-correcting MDS codes for $qleq8$ have been classified in earlier studies. These results are used here to complete the classification of all $7$-ary and $8$-ary MDS codes with $dgeq3$ using a computer search.

Recommendations

• Classification of MDS codes over small alphabets
• Classification of Graeco-Latin Cubes
• Latin hypercubes and MDS codes
• Extending MDS codes
• scientific article; zbMATH DE number 554072

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3200113 (Why is no real title available?)
• (6,3)-MDS codes over an alphabet of size 4
• A Census of Small Latin Hypercubes
• Atomic Latin squares of order eleven
• Classification algorithms for codes and designs
• Classification of Graeco-Latin Cubes
• Constructing combinatorial objects via cliques
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Enumeration of MOLS of small order
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Maximum distance separable codes and arcs in projective spaces
• On connection between reducibility of an \(n\)-ary quasigroup and that of its retracts.
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• On the Classification of MDS Codes
• On the maximality of linear codes
• Practical graph isomorphism. II.
• Small latin squares, quasigroups, and loops
• Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)

Cited in

(11)

• Problems of isomorphy concerning the algebraic representation of affine MDS-codes.
• (6,3)-MDS codes over an alphabet of size 4
• On additive MDS codes with linear projections
• New MDS or Near-MDS Self-Dual Codes
• On the non-existence of extended 1-perfect codes and MDS codes
• The equivalence of linear codes implies semi-linear equivalence
• Latin hypercubes and MDS codes
• Classification of MDS codes over small alphabets
• Comparing healthcare utilization patterns via global differences in the endorsement of current procedural terminology codes
• On additive MDS codes over small fields
• MDS codes in Doob graphs

Describes a project that uses

Uses Software

• libexact
• Cliquer

This page was built for publication: Further results on the classification of MDS codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326328)