• DocumentCode
    2268973
  • Title

    Tree-based construction of LDPC codes

  • Author

    Sridhara, Deepak ; Kelley, Christine ; Rosenthal, Joachim

  • Author_Institution
    Institut fur Mathematik, Zurich Univ.
  • fYear
    2005
  • fDate
    4-9 Sept. 2005
  • Firstpage
    845
  • Lastpage
    849
  • Abstract
    We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, one of which includes the well-known finite-geometry-based LDPC codes
  • Keywords
    geometry; iterative decoding; parity check codes; trees (mathematics); LDPC codes; finite-geometry; iterative decoding; pseudocodeword weight; tree-based construction; AWGN; Constraint theory; Floors; Geometry; Hamming distance; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Parity check codes; Tree graphs;
  • 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.1523456
  • Filename
    1523456
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2268973