On the minimum distance of turbo codes

A permutor (interleaver) design method is presented to show the existence of turbo codes with minimum distance growing logarithmically with the permutor length. It is demonstrated, that the method can also be useful for the construction of turbo codes with practical block lengths.