Sammanfattning
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
Originalspråk | engelska |
---|---|
Titel på värdpublikation | [Host publication title missing] |
Sidor | 108 |
DOI | |
Status | Published - 1997 |
Evenemang | IEEE International Symposium on Information Theory, 1997 - Ulm, Tyskland Varaktighet: 1997 juni 29 → 1997 juli 4 |
Konferens
Konferens | IEEE International Symposium on Information Theory, 1997 |
---|---|
Land/Territorium | Tyskland |
Ort | Ulm |
Period | 1997/06/29 → 1997/07/04 |
Ämnesklassifikation (UKÄ)
- Elektroteknik och elektronik