DocumentCode
2052623
Title
On the minimum distance of turbo codes
Author
Truhachev, Dmitri ; Lentmaier, Michael ; Wintzel, Ola ; Zigangirov, Kamil Sh
Author_Institution
Dept. of Inf. Technol., Lund Univ., Sweden
fYear
2002
fDate
2002
Firstpage
84
Abstract
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.
Keywords
interleaved codes; turbo codes; interleaver; minimum distance; permutor design; turbo codes; Convolutional codes; Councils; Design methodology; Information technology; Parity check codes; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023356
Filename
1023356
Link To Document