|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 2, Pages 50–53
(Mi ppi802)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
Lower Asymptotic Bound on the Number of Linear Code Words in a Sphere of Given Radius in $(F_q)^n$
V. M. Blinovskii
Abstract:
The random coding method is applied to determine the asymptotic lower bound on the number of words of a linear code from $(F_q)^n$, contained in a sphere of given radius. The bound is uniform relative to the center of the sphere. An upper bound is also derived on the covering radius of linear code. An upper estimate is obtained on the proportion of codes for which these bounds are valid.
Received: 11.05.1985
Citation:
V. M. Blinovskii, “Lower Asymptotic Bound on the Number of Linear Code Words in a Sphere of Given Radius in $(F_q)^n$”, Probl. Peredachi Inf., 23:2 (1987), 50–53; Problems Inform. Transmission, 23:2 (1987), 130–133
Linking options:
https://www.mathnet.ru/eng/ppi802 https://www.mathnet.ru/eng/ppi/v23/i2/p50
|
Statistics & downloads: |
Abstract page: | 332 | Full-text PDF : | 160 |
|