On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 (Q932607): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The classification of some perfect codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3792904 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian double Latin squares / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On multifold MDS and perfect codes that are not splittable into onefold codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A General Product Construction for Error Correcting Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5437058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized concatenated constructions of perfect binary nonlinear codes / rank | |||
Normal rank |
Latest revision as of 13:22, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 |
scientific article |
Statements
On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 (English)
0 references
11 July 2008
0 references
This paper is motivated by studying the 4-ary distance 2 MDS codes or, equivalently, the \(n\)-quasigroups of order 4. The author begins by defining the concept of a double-MDS-code, which is a set with properties of the union of two disjoint distance 2 MDS codes. The main result proved is the theorem on the decomposition of double-MDS-codes into prime double-MDS-codes and shown how to generalize the result to \(q/2\)-fold MDS codes. The decomposability of distance 2 MDS codes and \(n\)-quasigroups has also been discussed. Some auxiliary lemmas about functions with separable arguments (and used) have been proved in the Appendix.
0 references
MDS codes
0 references
maximum distances separable codes
0 references
\(n\)-ary quasigroups
0 references
decomposability
0 references
reducibility
0 references
frequency hypercubes
0 references
Latin hypercubes
0 references