Lossless data compression with error correcting codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 22-

  Caire, Giuseppe ^a   Shamai, Shlomo ^b   Verdú, Sergio ^c  

^a EURECOM   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CODES (SYMBOLS); ERROR CORRECTION; ITERATIVE METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PERFORMANCE; STATISTICAL METHODS;

BELIEF PROPAGATION ALGORITHM; BURROWS-WHEELER TRANSFORM; ERROR CORRECTING CODES; LOW DENSITY PARITY CHECK MATRIX; MINIMUM-DESCRIPTION-LENGTH PRINCIPLE;

DATA COMPRESSION;

EID: 0142008695     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228036     Document Type: Conference Paper

References (1)

1. M. Effros, K. Visweswariah, S. Kulkarni, and S. Verdú. Data compression based on the Burrows-Wheeler transform: Analysis and optimality. IEEE Trans. on Information Theory, 48:1061-1081, May 2002.