• DocumentCode
    1173155
  • Title

    A new upper bound on the minimum distance of turbo codes

  • Author

    Perotti, Alberto ; Benedetto, Sergio

  • Author_Institution
    Center for Multimedia Radio Commun., Politecnico di Torino, Italy
  • Volume
    50
  • Issue
    12
  • fYear
    2004
  • Firstpage
    2985
  • Lastpage
    2997
  • Abstract
    In this paper, a new upper bound on the minimum distance of turbo codes is derived. The new bound is obtained by construction of an undirected graph which reflects the characteristics of the constituent codes and the interleaver. The resulting expression shows that the minimum distance of a turbo code grows approximately with the base-3 logarithm of the information word length. The new bound is easy to compute, applies to rate k0/n0 constituent encoders, and often improves over existing results.
  • Keywords
    interleaved codes; turbo codes; base-3 logarithm; constituent encoder; information word length; interleaver code; minimum distance turbo code; permutation; undirected graph; Concatenated codes; Convolutional codes; Electronic mail; Error correction codes; Graph theory; Interleaved codes; Multimedia communication; Radio communication; Turbo codes; Upper bound; 65; Minimum distance; performance bounds; permutations; turbo codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2004.838358
  • Filename
    1362892
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1173155