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

DOI10.1007/S10623-011-9574-1zbMATH Open1272.94094arXiv1104.0005OpenAlexW3100598789MaRDI QIDQ438873FDOQ438873

Authors: Denis S. Krotov 

Publication date: 31 July 2012

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

Abstract: We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3,2^{n-m-1},4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the $n$-cube into six cells. An arbitrary binary $(n=2^m-4,2^{n-m},3)$ code $D$, i.e., a code with parameters of a triply-shortened Hamming code, is a cell of an equitable family (but not a partition) from six cells. As a corollary, the codes $C$ and $D$ are completely semiregular; i.e., the weight distribution of such a code depends only on the minimal and maximal codeword weights and the code parameters. Moreover, if $D$ is self-complementary, then it is completely regular. As an intermediate result, we prove, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable. Keywords: 1-perfect code; triply-shortened 1-perfect code; equitable partition; perfect coloring; weight distribution; distance distribution

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

Recommendations

• On the binary codes with parameters of doubly-shortened 1-perfect codes
• Binary codes of strongly regular graphs
• scientific article; zbMATH DE number 1498782
• Completely regular codes and completely transitive codes
• New families of completely regular codes and their corresponding distance regular coset graphs

zbMATH Keywords

weight distributionequitable partitionHamming codecoding theoryperfect coloringdistance distribution1-perfect codeextended codetriply-shortened 1-perfect code

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Title not available (Why is that?)
• On weight distributions of perfect colorings and completely regular codes
• The triply shortened binary Hamming code is optimal
• Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
• On the binary codes with parameters of doubly-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
• On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$

Cited In (9)

• Harmonic distributions for equitable partitions of a hypercube
• The extended 1-perfect trades in small hypercubes
• On triply even binary codes
• Perfect colorings of the infinite square grid: coverings and twin colors
• On calculation of the interweight distribution of an equitable partition
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• Perfect 2‐colorings of Hamming graphs
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16

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

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