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

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 distributionComment: 12 page

On weight distributions of perfect colorings and completely regular codes

“…Since this recursive relation coincides with (15) and the first elements h 0 , h 1 of the sequence also coincide with h 0 P 0 (S P ), h 0 P 1 (S P ), we see that h i = h 0 P i (S P ) = h 0 P i (P −1 1 (S )) for every i.…”

Harmonic Distributions for Equitable Partitions of a Hypercube

“…It follows from Theorem that By Theorem , the set of words of any fixed weight in the cells forms a 3‐design. Notice that S 1 and S 3 are entirely contained in C 21 and so these are 3‐designs that is uninteresting cases in design theory. Let C 31 be a shortened 1‐perfect code with parameter , . Then C 31 generates an equitable partition of with quotient matrix Then are eigenvectors of B with corresponding eigenvalues …”

“…The study of equitable partitions of a hypercube is important in the area of coding theory [, , ,7–10,, ] and algebraic graph theory [, ]. Equitable partitions of that can be obtained from completely regular codes generate orthogonal arrays and t‐designs [, ] from their first cells. It is known that the strength of a completely regular code in is where λ is the second largest eigenvalue of the quotient matrix.…”

“…It is known that the strength of a completely regular code in is where λ is the second largest eigenvalue of the quotient matrix. Krotov computes strengths of the first cells of certain equitable partitions of that are not completely regular codes. Van Tilborg proved that if C containing the zero word is a completely regular code in with minimum distance d , then the set of codewords in C of any fixed weight forms a ‐design.…”

Non-extendible latin parallelepipeds

“…A non-extendible latin ((2m −1)×(2m −1)×(m −1))-parallelepiped was constructed for all even m > 2 in [1]. Applications of non-completable latin parallelepipeds in coding theory and combinatorics are presented in [2,11,10,13,14].…”