• DocumentCode
    1049367
  • Title

    A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel

  • Author

    Johnson, Sarah J.

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Newcastle, NSW
  • Volume
    55
  • Issue
    1
  • fYear
    2009
  • Firstpage
    27
  • Lastpage
    32
  • Abstract
    This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes.
  • Keywords
    binary codes; parity check codes; LDPC codes; Tanner graphs; binary erasure channel; finite-length algorithm; low-density parity-check codes; Algorithm design and analysis; Asia; Australia Council; Computer science; Equations; Iterative algorithms; Iterative decoding; Parity check codes; Performance analysis; Sparse matrices; Binary erasure channels; finite-length analysis; iterative decoding; low-density parity-check (LDPC) codes; message-passing decoding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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