TY - GEN
T1 - An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes
AU - Johannesson, Rolf
AU - Zigangirov, Kamil
PY - 1996
Y1 - 1996
N2 - 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
AB - 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
U2 - 10.1109/ICCT.1996.545243
DO - 10.1109/ICCT.1996.545243
M3 - Paper in conference proceeding
SN - 0-7803-2916-3
VL - 1
SP - 548
EP - 551
BT - [Host publication title missing]
T2 - International Conference on Communication Technology , ICCT'96
Y2 - 5 May 1996 through 7 May 1996
ER -