Combinatorial analysis of the minimum distance of turbo codes |
| |
Authors: | Breiling M Huber JB |
| |
Affiliation: | Lehrstuhl fur Nachrichtentech. II., Erlangen-Nurnberg Univ.; |
| |
Abstract: | In this paper, new upper bounds on the maximum attainable minimum Hamming distance of turbo codes with arbitrary-including the best-interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, the code rate, and the scramblers employed in the encoder. Examples of the new bounds for particular turbo codes are given and discussed. The new bounds are tighter than all existing ones and prove that the minimum Hamming distance of turbo codes cannot asymptotically grow at a rate more than the third root of the codeword length |
| |
Keywords: | |
|
|