Smooth compression, Gallager bound and nonlinear sparse-graph codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2474-2478

  Montanari, Andrea ^a   Mossel, Elchanan ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE WORDS; COMPRESSION SCHEMES; GALLAGER BOUND; GRAPH CODES; INTERNATIONAL SYMPOSIUM; NON-LINEAR FUNCTIONS; OPTIMAL COMPRESSION; SOURCE CODING; SPARSE GRAPHS;

CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; GRAPH THEORY; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS; TURBO CODES;

DATA COMPRESSION;

EID: 52349092824     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595436     Document Type: Conference Paper

References (12)

1. T. Cover and J. A. Thomas, Elements of Information Theory, Wiley Interscience, New York, 1991
2. S. Dharmapurikar, A. Kabbani, Y. Lu, A. Montanari and B. Prabhakar. "Counter Braids: A Novel Counter Architecture for Per-Flow Measurement." Sigmetrics, June 2008
3. th Allerton Conference, Monticello IL, October 2007
4. R. G. Gal lager, Low-Density Parity-Check Codes. MIT Press, Cambridge, Massachussetts, 1963.
5. T. Richardson and R. Urbanke, Modern Coding Theory, draft available at http://lthcwww.epfl.ch/mct/index.php
6. G. Caire, S. Shamai, and S. Verdu. "Noiseless data compression with low density parity check codes." In P. Gupta and G. Kramer, editors, Dimacs Series in Mathematics and Theoretical Computer Science, pages 224-235. AMS, 2004.
7. G. Miller and D. Burshtein, "Asymptotic enumeration method for analyzing LDPC codes," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1115-1131, June 2004.
8. A. Bennatan and D. Burshtein. "On the application of LDPC Codes to Arbitrary Discrete-Memoryless Channels." IEEE Trans. Inform. Theory, 50:417-438, 2004.
9. M. J. Wainwright and E. Maneva, "Lossy source encoding via messagepassing and decimation over generalized codewords of LDGM codes," Proc. IEEE Int. Sytnp. on Inf. Theory, Adelaide, September 2005
10. S. Ciliberti, M. Mézard and R. Zecchina, "Lossy data compression with random gates," Phys. Rev. Lett. 95 (2005) 038701
11. N. Linial, "Finite Metric Spaces - Combinatorics, Geometry and Algorithms," Proc. Int. Cong. Math. III, 573-586 Beijing, 2002
12. M. Keane and M. Smorodinsky, "Bernoulli schemes of the same entropy are finitarily isomormphic," Ann. of Math. 109 (1970) 397-406