|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 1, Pages 122–130
(Mi ppi326)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
On the Theory of List Decoding of Convolutional Codes
K. Sh. Zigangirov, R. Johannesson
Abstract:
Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and nonsystematic encoders. From these bounds it follows that the necessary list size grows exponentially with the number of corrected errors. We obtain an expurgated upper bound on the probability of the correct path loss for the ensemble of time-invariant binary convolutional codes. The notion of an $\ell$-list weight enumerator is introduced and used to obtain an upper bound on the probability of the correct path loss for list decoding of a fixed convolutional code.
Citation:
K. Sh. Zigangirov, R. Johannesson, “On the Theory of List Decoding of Convolutional Codes”, Probl. Peredachi Inf., 32:1 (1996), 122–130; Problems Inform. Transmission, 32:1 (1996), 104–111
Linking options:
https://www.mathnet.ru/eng/ppi326 https://www.mathnet.ru/eng/ppi/v32/i1/p122
|
Statistics & downloads: |
Abstract page: | 325 | Full-text PDF : | 136 |
|