Sammanfattning
The active tailbiting segment distance for convolutional codes is introduced. Together with the earlier defined active burst distance, it describes the error correcting capability of a tailbiting code encoded by a convolutional encoder. Lower bounds on the new active distance as well as an upper bound on the ratio between tailbiting length and memory of the encoder such that its minimum
Originalspråk | engelska |
---|---|
Titel på värdpublikation | [Host publication title missing] |
Sidor | 290 |
DOI | |
Status | Published - 2001 |
Evenemang | 2001 International Symposium on Information Theory - Washington, D.C. Varaktighet: 2001 juni 24 → 2001 juni 29 |
Konferens
Konferens | 2001 International Symposium on Information Theory |
---|---|
Period | 2001/06/24 → 2001/06/29 |
Ämnesklassifikation (UKÄ)
- Elektroteknik och elektronik