scientific article; zbMATH DE number 1498782

Authors Sergey Avgustinovich, Faina I. Solov'eva

Publication date 3 September 2000

distance-invariant code distance-regularity perfect binary codes

Combinatorial aspects of packing and covering (05B40) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)

Review text

The problem of distance-regularity for perfect binary codes is considered. A code is distance-invariant if the number \(A_{i}(n)\) of all codewords on distance \(i\) from the fixed codeword does not depend on the choice of the codeword. It is known that a perfect binary code is distance-invariant. A binary code of length \(n\) is distance-regular if, for all codewords \(\alpha, \beta\) and all integers \(i,j \in \{1,\dots,n\}\), the number of codewords \(\gamma\) such that \(d(\alpha, \gamma) = i\), \ \(d(\beta, \gamma) = j\), does not depend on the choice of \(\alpha, \beta\) but only on \(d(\alpha, \beta)\). It is established that, regardless of distance-invariancy, all perfect binary codes with distance 3 are not distance-regular except the Hamming codes of length 3 and 7. For the entire collection see [Zbl 0918.00043].

Recommendations

Cited in

(8)

This page was built for publication:

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