|
Problemy Peredachi Informatsii, 1965, Volume 1, Issue 4, Pages 45–48
(Mi ppi763)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Сorrespondence
On Some Properties of Random Group Codes of Great Length
V. N. Koshelev
Abstract:
It is shown that a randomly chosen linear binary code almost certainly satisfies the Varshamov–Gilbert bound. The probability of a large deviation from this bound tends to zero exponentially with increase of the code length.
Received: 22.09.1964
Citation:
V. N. Koshelev, “On Some Properties of Random Group Codes of Great Length”, Probl. Peredachi Inf., 1:4 (1965), 45–48; Problems Inform. Transmission, 1:4 (1965), 35–38
Linking options:
https://www.mathnet.ru/eng/ppi763 https://www.mathnet.ru/eng/ppi/v1/i4/p45
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 190 |
|