RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1987 Volume 23, Issue 2, Pages 50–53 (Mi ppi802)

This article is cited 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.

UDC: 621.391.15

Received: 11.05.1985


 English version:
Problems of Information Transmission, 1987, 23:2, 130–133

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024