• DocumentCode
    752197
  • Title

    Error exponents of expander codes

  • Author

    Barg, Alexander ; Zémor, Gilles

  • Author_Institution
    Lucent Technol. Bell Labs., Murray Hill, NJ, USA
  • Volume
    48
  • Issue
    6
  • fYear
    2002
  • fDate
    6/1/2002 12:00:00 AM
  • Firstpage
    1725
  • Lastpage
    1729
  • Abstract
    We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and the channel capacity. The decoding complexity grows linearly with the code length
  • Keywords
    channel capacity; codes; error statistics; iterative decoding; binary-symmetric channel capacity; code length; code rate; decoding complexity; error exponents; error probability; expander codes; iterative decoding; large minimum distance; Binary codes; Channel capacity; Circuits; Concatenated codes; Entropy; Error correction codes; Error probability; Graph theory; Iterative algorithms; Iterative decoding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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