• DocumentCode
    2265731
  • Title

    Repeat-accumulate codes that approach the Gilbert-Varshamov bound

  • Author

    Brown, Andrew ; Luby, Michael ; Shokrollahi, Amin

  • Author_Institution
    EPFL, Lausanne
  • fYear
    2005
  • fDate
    4-9 Sept. 2005
  • Firstpage
    169
  • Lastpage
    173
  • Abstract
    We show, using a probabilistic argument, that for any y with 0 < y < 1 there exist repeat-accumulate codes that approach the asymptotic Gilbert-Varshamov bound, and that are encodable in time O(n 1+y)
  • Keywords
    decoding; encoding; asymptotic Gilbert-Varshamov bound; erasure channel; graph based codes; repeat-accumulate codes; Algorithm design and analysis; Channel capacity; Decoding; Eigenvalues and eigenfunctions; Encoding; Entropy; Random sequences;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
  • Conference_Location
    Adelaide, SA
  • Print_ISBN
    0-7803-9151-9
  • Type

    conf

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