• DocumentCode
    2057047
  • Title

    On the free distance of LDPC convolutional codes

  • Author

    Sridharan, Arun ; Truhachev, Dmitry ; Lentmaier, Michael ; Costello, Daniel J. ; Zigangirov, K.S.

  • Author_Institution
    Notre Dame Univ., IN
  • fYear
    2004
  • fDate
    June 27 2004-July 2 2004
  • Firstpage
    312
  • Lastpage
    312
  • Abstract
    A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices comprised of MtimesM permutation matrices is derived. We show that asymptotically, i.e., as Mrarrinfin, for almost all codes in the ensemble the free distance grows linearly with constraint length
  • Keywords
    convolutional codes; matrix algebra; parity check codes; LDPC convolutional code; permutation matrices; Block codes; Convolutional codes; Mathematics; Parity check codes; Probability distribution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2004.1365349
  • Filename
    1365349
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2057047