On regular quasi-cyclic LDPC codes from binomials

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 274-

  Smarandache, Roxana ^a   Vontobel, Pascal O ^b  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINOMIALS; ISOMORPHISM; MONOMIALS; WORD-ERROR RATES (WER);

DECODING; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS;

CODES (SYMBOLS);

EID: 5044247901     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999) (B. Marcus and J. Rosenthal, eds.), PP-113-130, Springer Verlag, New York, Inc., 2001.
2. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. of ICSTA 2001, (Ambleside, England), 2001.
3. M. Fossorier, "Quasi-cyclic low density parity check codes from circulant permutation matrices," submitted to IEEE Trans. Inform. Theory, 2003.