On the minimum distance of turbo codes

In English A permutor (interleaver) design method was proposed to show the existence of turbo codes with minimum distance growing logarithmically with the permutor length. It was found that the minimum distance of a turbo code depended on the structure of the permutor or on its life cycle structures. It was demonstrated that the method could be used for the construction of turbo codes with practical blocklengths.