Estimates for distribution of the minimal distance of a random linear code. (English. Russian original) Zbl 1347.94073

Discrete Math. Appl. 26, No. 4, 203-211 (2016); translation from Diskretn. Mat. 27, No. 2, 45-55 (2015).
Summary: The distribution function of the minimum distance (the minimum weight of nonzero codewords) of a random linear code over a finite field is studied. Expicit bounds in the form of inequalities and asymptotic estimates for this distribution function are obtained.


94B05 Linear codes (general theory)
Full Text: DOI MNR


[1] Peterson W. W., Weldon E. J.,Error-Correcting Codes, 2nd edition, MIT Press, 1972, 572 pp. · Zbl 0251.94007
[2] MacWilliams E. J., Sloane N. J. A.,The Theory of Error-Correcting Codes. Parts I, II., North-Holland, Amsterdam, 1977. · Zbl 0369.94008
[3] Sidelnikov V. M.,Coding Theory. Handbook on Principles and Methods of Coding, M.: MGU, 2006 (in Russian).
[4] Kopyttcev V. A., Mikhailov V. G., “Poisson-type theorems for the number of special solutions of a random linear inclusion”, Discrete Math. Appl., 20 :2 (2010), 191-211. · Zbl 1223.60048
[5] Kopyttcev V. A., Mikhailov V. G., “Explicit estimates of the accuracy for the Poisson approximation to the distribution of the number of solutions of random inclusions”,Matematicheskie Voprosy Kriptografii, 6 :1 (2015), 57-79 (in Russian).
[6] Zubkov A. M., Kruglov V. I., “Moments of codeword weights in random binary linear codes”,Matematicheskie Voprosy Kriptografii, 3 :4 (2012), 55-70 (in Russian).
[7] Zubkov A. M., Kruglov V. I., “Statistical characteristics of weight spectra of random linear codes over GF(p)”,Matematicheskie Voprosy Kriptografii, 5 :1 (2014), 27-38 (in Russian).
[8] Borovkov A. A.,Probability Theory, New York: Gordon & Breach, 1998, 474 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.