|
Problemy Peredachi Informatsii, 1986, Volume 22, Issue 1, Pages 11–25
(Mi ppi839)
|
|
|
|
This article is cited in 18 scientific papers (total in 18 papers)
Information Theory and Coding Theory
Bounds for Codes in the Case of Finite-Volume List Decoding
V. M. Blinovskii
Abstract:
The author obtains asymptotic upper and lower bounds for the cardinality of a binary code that is decoded by a list of fixed volume, for the case in which the average radius or radius of the decoding sphere of the code is specified. The resultant bounds are asymptotically exact in the case of zero rate.
Received: 14.02.1984
Citation:
V. M. Blinovskii, “Bounds for Codes in the Case of Finite-Volume List Decoding”, Probl. Peredachi Inf., 22:1 (1986), 11–25; Problems Inform. Transmission, 22:1 (1986), 7–19
Linking options:
https://www.mathnet.ru/eng/ppi839 https://www.mathnet.ru/eng/ppi/v22/i1/p11
|
Statistics & downloads: |
Abstract page: | 566 | Full-text PDF : | 273 |
|