Designing LDPC codes using Bit-Filling

IEEE International Conference on Communications

Volumn 1, Issue , 2001, Pages 55-59

  Campello, J ^a   Modha, D S ^a   Rajagopalan, S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA;

BIT-FILLING ALGORITHMS; LOW DENSITY PARITY-CHECK CODES (LDPC);

ENCODING (SYMBOLS);

EID: 0034870116     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Good error-correcting codes based on very sparse matrices
2. Design of provably good low-density parity check codes
3. Explicit group-theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators
4. Explicit expanders and the Ramanujan conjectures
5. Comparison of constructions of irregular Gallager codes
6. Evaluation of Gallager codes for short block length and high rate applications
7. Analysis of low-density codes and improved designs using irregular graphs
8. Array codes as Idpc codes
9. Low density parity check codes based on ̌nite geometries: A rediscovery
10. Relationship between density and deterministic complexity of NP-complete languages