Further results on the classification of MDS codes

DOI10.3934/AMC.2016020zbMATH Open1348.94097arXiv1504.06982OpenAlexW2963087706MaRDI QIDQ326328FDOQ326328

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)

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.

Full work available at URL: https://arxiv.org/abs/1504.06982

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

zbMATH Keywords

classificationLatin hypercubeMDS code

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• 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
• On additive MDS codes over small fields
• Comparing healthcare utilization patterns via global differences in the endorsement of current procedural terminology codes
• MDS codes in Doob graphs

Uses Software

• Cliquer
• libexact

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)