Robustly-optimal rate one-half binary convolutional codes

Research output: Contribution to journalArticlepeer-review

194 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)464-468
JournalIEEE Transactions on Information Theory
Volume21
Issue number4
Publication statusPublished - 1975

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Robustly-optimal rate one-half binary convolutional codes'. Together they form a unique fingerprint.

Cite this