|
Problemy Peredachi Informatsii, 1998, Volume 34, Issue 3, Pages 47–49
(Mi ppi416)
|
|
|
|
This article is cited in 4 scientific papers (total 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.
Received: 07.07.1997 Revised: 02.12.1997
Citation:
S. V. Avgustinovich, F. I. Solov'eva, “On Distance Regularity of Perfect Binary Codes”, Probl. Peredachi Inf., 34:3 (1998), 47–49; Problems Inform. Transmission, 34:3 (1998), 247–249
Linking options:
https://www.mathnet.ru/eng/ppi416 https://www.mathnet.ru/eng/ppi/v34/i3/p47
|
Statistics & downloads: |
Abstract page: | 380 | Full-text PDF : | 101 | References: | 46 | First page: | 2 |
|