On the binary codes with parameters of doubly-shortened 1-perfect codes

DOI10.1007/S10623-009-9360-5MaRDI QIDQ2638426zbMATH OpenOpenAlexFDO

Authors Denis S. Krotov

Publication date 16 September 2010

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

doubly-shortened 1-perfect codeembeddingequitable partitionone-perfect codeperfect coloring

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

Abstract: We show that any binary $(n=2^m-3,2^{n-m},3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $C_1,C_2,C_3,C_4$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the possibility to lengthen the code $C_1$ to a 1-perfect code of length $n+2$ is equivalent to the possibility to split the part $C_4$ into two distance-3 codes or, equivalently, to the biparticity of the graph of distances 1 and 2 of $C_4$. In any case, $C_1$ is uniquely embeddable in a twofold 1-perfect code of length $n+2$ with some structural restrictions, where by a twofold 1-perfect code we mean that any vertex of the space is within radius 1 from exactly two codewords.

Review text

The main consideration of this paper is to address the following problem for which the author gives a partial answer and open perspectives: Whether every \((2^k-3, 2^{2^k-3-k}, 3)\) code is a doubly-shortened 1-perfect code? The author constructs an interesting design `unsplittable twofold Steiner triple system' whose completing to twofold 1-perfect code would mean the negative answer to the main problem. A connection between the main problem and the problem of completing Latin hypercuboids of order 4 (quaternary distance-2 MDS codes) is shown. An equivalent formulation of the main problem in terms of distance-4 codes is also discussed.

Recommendations

• On the binary codes with parameters of triply-shortened 1-perfect codes
• scientific article; zbMATH DE number 850320
• On a property of perfect binary codes
• On perfect \(p\)-ary codes of length \(p+1\)
• On binary 1-perfect additive codes: some structural properties
• On the Duals of Binary Hyper-Kloosterman Codes
• On a lower bound on the number of perfect binary codes
• Perfect binary codes: bounds and properties
• scientific article; zbMATH DE number 503208
• Shortening Array Codes and the Perfect $1$-Factorization Conjecture

Cites work

• n-ary quasigroups of order 4.
• A Census of Small Latin Hypercubes
• A General Product Construction for Error Correcting Codes
• A survey of perfect codes
• Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3178047 (Why is no real title available?)
• scientific article; zbMATH DE number 822751 (Why is no real title available?)
• On multifold MDS and perfect codes that are not splittable into onefold codes
• On perfect binary codes
• On Perfect Codes and Tilings: Problems and Solutions
• Perfect binary codes: constructions, properties, and enumeration
• The classification of some perfect codes
• The triply shortened binary Hamming code is optimal
• There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
• Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes

Cited in

(11)

• Codes of Steiner triple and quadruple systems
• Non-extendible Latin parallelepipeds
• The extended 1-perfect trades in small hypercubes
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• On the binary codes with parameters of triply-shortened 1-perfect codes
• Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1
• Shortening Array Codes and the Perfect $1$-Factorization Conjecture
• Harmonic distributions for equitable partitions of a hypercube
• Perfect 2‐colorings of Hamming graphs
• On weight distributions of perfect colorings and completely regular codes
• Local duality for equitable partitions of a Hamming space

This page was built for publication: On the binary codes with parameters of doubly-shortened 1-perfect codes

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