An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes
Author
Summary, in English
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
Publishing year
1996
Language
English
Pages
548-551
Publication/Series
[Host publication title missing]
Volume
1
Full text
- Available as PDF - 334 kB
- Download statistics
Document type
Conference paper
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
International Conference on Communication Technology , ICCT'96
Conference date
1996-05-05 - 1996-05-07
Conference place
Beijing, China
Status
Published
ISBN/ISSN/Other
- ISBN: 0-7803-2916-3