The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the theory of list decoding of convolutional codes

På svenska

Author

Summary, in English

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 l-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.

Publishing year

1996

Language

English

Pages

104-111

Publication/Series

Problems of Information Transmission

Volume

32

Issue

1

Document type

Journal article

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

ISBN/ISSN/Other

  • ISSN: 0032-9460