• DocumentCode
    1297604
  • Title

    Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes

  • Author

    Truhachev, Dmitry ; Zigangirov, K.Sh. ; Costello, Daniel J.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
  • Volume
    56
  • Issue
    9
  • fYear
    2010
  • Firstpage
    4301
  • Lastpage
    4308
  • Abstract
    Existence type lower bounds on the free distance of periodically time-varying LDPC convolutional codes and on the minimum distance of tail-biting LDPC convolutional codes are derived. It is demonstrated that the bound on free distance of periodically time-varying LDPC convolutional codes approaches the bound on free distance of general (nonperiodic) time-varying LDPC convolutional codes as the period increases. The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting LDPC convolutional codes, which is of interest in its own right.
  • Keywords
    convolutional codes; parity check codes; distance bounds; free distance; periodically time-varying LDPC convolutional codes; tail-biting LDPC convolutional codes; Block codes; Code standards; Convolutional codes; Information technology; NASA; Parity check codes; Free distance; LDPC convolutional codes; low-density parity-check (LDPC) codes; lower bounds; minimum distance; tail-biting LDPC convolutional codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2010.2053873
  • Filename
    5550417