Advanced

On the minimum distance of turbo codes

Truhachev, Dmitri; Lentmaier, Michael LU ; Wintzell, Ola LU and Zigangirov, Kamil LU (2002) IEEE International Symposium on Information Theory (ISIT), 2002 In IEEE International Symposium on Information Theory - Proceedings p.84-84
Abstract
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Trellis diagrams
in
IEEE International Symposium on Information Theory - Proceedings
pages
84 - 84
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2002
external identifiers
  • WOS:000177912700084
  • Other:CODEN: PISTFZ
  • Scopus:0036352038
DOI
10.1109/ISIT.2002.1023356
language
English
LU publication?
yes
id
b6efb9b1-b0f6-4629-a16e-73bdc22532bd (old id 611187)
date added to LUP
2007-11-29 11:12:01
date last changed
2016-10-13 04:45:50
@misc{b6efb9b1-b0f6-4629-a16e-73bdc22532bd,
  abstract     = {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.},
  author       = {Truhachev, Dmitri and Lentmaier, Michael and Wintzell, Ola and Zigangirov, Kamil},
  keyword      = {Trellis diagrams},
  language     = {eng},
  pages        = {84--84},
  publisher    = {ARRAY(0xa20f2b0)},
  series       = {IEEE International Symposium on Information Theory - Proceedings},
  title        = {On the minimum distance of turbo codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2002.1023356},
  year         = {2002},
}