Design of provably good low-density parity check codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 199-

  Richardson, Thomas ^a   Urbanke, Rudiger ^b  

^a NOKIA RESEARCH CENTER   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; BIT ERROR PROBABILITY; LOW DENSITY PARITY CHECK CODES;

BIT ERROR RATE; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; THEOREM PROVING; THRESHOLD LOGIC;

CODES (SYMBOLS);

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

References (4)

1. Low-density parity-check codes
2. The capacity of low-density parity-check codes under message passing decoding
3. Design of provably good low-density parity-check codes
4. Analysis of low-density codes and improved designs using irregular graphs