On expander codes

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 835-837

  Zemor G ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Decoding; Expander code; Ramanujan graph

Indexed keywords

CODING ERRORS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION;

ERROR CORRECTING CODES; EXPANDER CODES;

ENCODING (SYMBOLS);

EID: 0035246490     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910593     Document Type: Article

References (6)

1. Expander codes
2. A recursive approach to Low-complexity codes
3. Ramanujan graphs
4. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
5. Explicit construction of linear sized tolerant networks