A coding theorem for lossy data compression by LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 461-

  Matsunaga, Yuko ^a   Yamamoto, Hirosuke ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

LOW DENSITY PARITY CHECK (LDPC) CODES;

CHANNEL CAPACITY; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMPRESSION; ERROR CORRECTION; ITERATIVE METHODS; THEOREM PROVING; VECTORS;

ENCODING (SYMBOLS);

EID: 0036350109     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Low density parity check codes
2. Good error-correcting codes based on very sparse matrices
3. Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes