Effective free distance of turbo codes

Abstract
The authors define and study the effective free distance of a turbo code. If a turbo code is constructed from a number of component codes, they argue that the effective free distance can be maximised by choosing the component codes to be IIR convolutional code fragments with maximal input weight-2 free distance. They then present some theoretical bounds for, and some numerical tables of; IIR code fragments with maximal input weight-2 free distance.