An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes

Rolf Johannesson, Kamil Zigangirov

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

152 Downloads (Pure)

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
Original languageEnglish
Title of host publication[Host publication title missing]
Pages548-551
Volume1
DOIs
Publication statusPublished - 1996
EventInternational Conference on Communication Technology , ICCT'96 - Beijing, China
Duration: 1996 May 51996 May 7

Publication series

Name
Volume1

Conference

ConferenceInternational Conference on Communication Technology , ICCT'96
Country/TerritoryChina
CityBeijing
Period1996/05/051996/05/07

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes'. Together they form a unique fingerprint.

Cite this