• DocumentCode
    3274313
  • Title

    Weight distributions: how deviant can you be?

  • Author

    Di, Changyan ; Urbanke, Rüdiger ; Richardson, Tom

  • Author_Institution
    Commun. Theory Lab., EPFL, Lausanne, Switzerland
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    50
  • Abstract
    We investigate the asymptotic weight distribution of LDPC (low density parity check) code ensembles. We show that two cases, namely, linear and logarithmic growth of the minimum distance can be distinguished, depending on the degree distribution pair. Furthermore, combining this result with Shokrollahi´s (2000) flatness condition, we get the surprising conclusion: if we want to achieve capacity, we cannot have large minimum distance!
  • Keywords
    channel capacity; channel coding; codes; LDPC code ensembles; Shokrollahi flatness condition; asymptotic weight distribution; capacity; degree distribution pair; linear growth; logarithmic growth; low density parity check codes; minimum distance; weight distributions; Parity check codes; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-7803-7123-2
  • Type

    conf

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