A new upper bound on the minimum distance of turbo codes

Authors:
A. Perotti;S. Benedetto
Affiliations:
Center for Multimedia Radio Commun., Politecnico di Torino, Italy;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 1

Capacity-approaching irregular turbo codes for the binary erasure channel

IEEE Transactions on Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

In this paper, a new upper bound on the minimum distance of turbo codes is derived. The new bound is obtained by construction of an undirected graph which reflects the characteristics of the constituent codes and the interleaver. The resulting expression shows that the minimum distance of a turbo code grows approximately with the base-3 logarithm of the information word length. The new bound is easy to compute, applies to rate k0/n0 constituent encoders, and often improves over existing results.