RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1998 Volume 34, Issue 3, Pages 47–49 (Mi ppi416)
This article is cited in 4 papers

Coding Theory

On Distance Regularity of Perfect Binary Codes

S. V. Avgustinovich, F. I. Solov'eva


Abstract: Perfect binary codes with distance 3 are considered. We prove that, among these codes, only Hamming codes of length 3 or 7 are distance-regular.

UDC: 621.391.15

Received: 07.07.1997
Revised: 02.12.1997


 English version: Problems of Information Transmission, 1998, 34:3, 247–249

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025