The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the minimum distance of turbo codes

På svenska

Author

Summary, in English

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.

Publishing year

2002

Language

English

Pages

84-84

Publication/Series

IEEE International Symposium on Information Theory - Proceedings

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Trellis diagrams

Conference name

IEEE International Symposium on Information Theory (ISIT), 2002

Conference date

2002-06-30 - 2002-07-05

Conference place

Lausanne, Switzerland

Status

Published

ISBN/ISSN/Other

  • CODEN: PISTFZ