Abstract
The distribution of the output error burst lengths from a Viterbi decoder is of particular interest in connection with concatenated coding systems, where the inner code is convolutional. From the expurgated, random, and sphere-packing exponents for block codes an upper bound on this distribution for the ensemble of periodically time-varying convolutional codes is obtained. Finally, the distribution obtained from simulating time-invariant convolutional codes is presented
Original language | English |
---|---|
Title of host publication | [Host publication title missing] |
Pages | 108 |
DOIs | |
Publication status | Published - 1997 |
Event | IEEE International Symposium on Information Theory, 1997 - Ulm, Germany Duration: 1997 Jun 29 → 1997 Jul 4 |
Conference
Conference | IEEE International Symposium on Information Theory, 1997 |
---|---|
Country/Territory | Germany |
City | Ulm |
Period | 1997/06/29 → 1997/07/04 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering