By Topic

On the minimum distance of turbo codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Truhachev, D. ; Dept. of Inf. Technol., Lund Univ., Sweden ; Lentmaier, M. ; Wintzell, O. ; Zigangirov, K.S.

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: