|
Problemy Peredachi Informatsii, 1972, Volume 8, Issue 1, Pages 26–35
(Mi ppi772)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Coding Theory
On Perfect Codes
V. A. Zinov'ev, V. K. Leont'ev
Abstract:
It is shown that the length of a nontrivial perfect code over the Galois field $GF(q)$ correcting $t\geqslant8$ errors is strictly bounded on both sides. This result implies that for values of $q=2,3,4,5,7$ and 8 nontrivial perfect codes other than the already known Hamming and Golay codes are nonexistent.
Received: 25.08.1971
Citation:
V. A. Zinov'ev, V. K. Leont'ev, “On Perfect Codes”, Probl. Peredachi Inf., 8:1 (1972), 26–35; Problems Inform. Transmission, 8:1 (1972), 17–24
Linking options:
https://www.mathnet.ru/eng/ppi772 https://www.mathnet.ru/eng/ppi/v8/i1/p26
|
Statistics & downloads: |
Abstract page: | 474 | Full-text PDF : | 190 | First page: | 2 |
|