|
Problemy Peredachi Informatsii, 1974, Volume 10, Issue 2, Pages 43–51
(Mi ppi1028)
|
|
|
|
Coding Theory
Upper Bounds for the Number of Points of a Binary Code with a Specified Code Distance
V. M. Sidel'nikov
Abstract:
An upper bound is obtained for the number of points of a binary code of length $n$ and code distance $d$; the new bound improves the Elias bound by a factor that grows exponentially with $n$; a new upper bound is also obtained for the number of points of a binary equilibrium code.
Received: 19.12.1973
Citation:
V. M. Sidel'nikov, “Upper Bounds for the Number of Points of a Binary Code with a Specified Code Distance”, Probl. Peredachi Inf., 10:2 (1974), 43–51; Problems Inform. Transmission, 10:2 (1974), 124–131
Linking options:
https://www.mathnet.ru/eng/ppi1028 https://www.mathnet.ru/eng/ppi/v10/i2/p43
|
|