Critical Lengths of Error Events in Convolutional Codes

Jørn Justesen, Jakob Dahl Andersen

Research output: Contribution to journalJournal articleResearchpeer-review

321 Downloads (Pure)


If the calculation of the critical length is based on the expurgated exponent, the length becomes nonzero for low error probabilities. This result applies to typical long codes, but it may also be useful for modeling error events in specific codes
Original languageEnglish
JournalI E E E Transactions on Information Theory
Issue number4
Pages (from-to)1608-1611
Publication statusPublished - 1998
EventIEEE Internation Symposium on Information Theory - Trondheim, Norway
Duration: 1 Jan 1994 → …


ConferenceIEEE Internation Symposium on Information Theory
CityTrondheim, Norway
Period01/01/1994 → …

Bibliographical note

Copyright: 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Critical Lengths of Error Events in Convolutional Codes'. Together they form a unique fingerprint.

Cite this