Title :
An expurgation upper bound on the probability of correct path loss for list decoding of time-invariant convolutional codes
Author :
Johannesson, Rolf ; Zigangirov, Kamil Sh
Author_Institution :
Dept. of Inf. Theory, Lund Univ., Sweden
Abstract :
In this paper list decoding of convolutional codes is considered. List decoding is a very powerful, low complexity, non-backtracking decoding method that does not fully exploit the error correcting capability of the code. A correct path loss is a serious kind of error event that is typical for list decoding. An expurgated upper bound on the probability of correct path loss is derived for the ensembles of systematic and nonsystematic time-varying convolutional codes
Keywords :
computational complexity; convolutional codes; decoding; error correction codes; losses; probability; error correcting capability; expurgation upper bound; list decoding; nonbacktracking decoding; path loss; probability; time-invariant convolutional codes; time-varying convolutional codes; Convolutional codes; Decoding; Error correction; Error correction codes; Error probability; Feedforward systems; Information theory; State-space methods; Upper bound; Viterbi algorithm;
Conference_Titel :
Communication Technology Proceedings, 1996. ICCT'96., 1996 International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-2916-3
DOI :
10.1109/ICCT.1996.545243
