Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 4-

  Rosenthal, Joachim ^a   Vontobel, Pascal O ^b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CODE CONSTRUCTION; LOW DENSITY PARITY CHECK CODES; RAMANUJAN GRAPHS;

DECODING; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA;

CODES (SYMBOLS);

EID: 0034857480     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2001.935867     Document Type: Article

References (5)

1. Explicit constructions of graphs without short cycles and low density codes
2. Design of capacity-approaching irregular low-density parity-check codes
3. Ramanujan graphs
4. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators
5. Constructions of LDPC codes using ramanujan graphs and ideas from Margulis