Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Rolf Johannesson (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: