• DocumentCode
    1145637
  • Title

    Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

  • Author

    Burshtein, David ; Miller, Gadi

  • Author_Institution
    Sch. of Electr. Eng., Tel Aviv Univ., Israel
  • Volume
    50
  • Issue
    11
  • fYear
    2004
  • Firstpage
    2837
  • Lastpage
    2844
  • Abstract
    We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.
  • Keywords
    binary codes; channel capacity; iterative decoding; maximum likelihood decoding; parity check codes; BEC; LDPC codes; ML decoding; binary erasure channel; computational complexity; iterative decoding; low-density parity-check codes; maximum-likelihood decoding; Algorithm design and analysis; Channel capacity; Computational complexity; Equations; Internet; Iterative algorithms; Iterative decoding; Linear systems; Maximum likelihood decoding; Parity check codes; BEC; Binary erasure channel; LDPC; ML; codes; decoding; iterative decoding; low-density parity-check; maximum-likelihood;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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