Abstract
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
Original language | English |
---|---|
Title of host publication | [Host publication title missing] |
Pages | 290 |
DOIs | |
Publication status | Published - 2001 |
Event | 2001 International Symposium on Information Theory - Washington, D.C. Duration: 2001 Jun 24 → 2001 Jun 29 |
Conference
Conference | 2001 International Symposium on Information Theory |
---|---|
Period | 2001/06/24 → 2001/06/29 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering