Robustly-optimal rate one-half binary convolutional codes
Författare
Summary, in English
Three optimality criteria for convolutional codes are considered in this correspondence: namely, free distance, minimum distance, and distance profile. Here we report the results of computer searches for rate one-half binary convolutional codes that are "robustly optimal" in the sense of being optimal for one criterion and optimal or near-optimal for the other two criteria. Comparisons with previously known codes are made. The results of a computer simulation are reported to show the importance of the distance profile to computational performance with sequential decoding.
Publiceringsår
1975
Språk
Engelska
Sidor
464-468
Publikation/Tidskrift/Serie
IEEE Transactions on Information Theory
Volym
21
Issue
4
Fulltext
Länkar
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0018-9448