Nonlinear sparse-graph codes for lossy compression

IEEE Transactions on Information Theory

Volumn 55, Issue 5, 2009, Pages 1961-1975

  Gupta, Ankit ^a   Verdú, Sergio ^a  

^a Princeton University   (United States)

Author keywords

Discrete memoryless sources; Lossy data compression; Rate distortion theory; Source channel coding duality; Sparse graph codes

Indexed keywords

DISCRETE MEMORYLESS SOURCES; LOSSY DATA COMPRESSION; RATE-DISTORTION THEORY; SOURCE-CHANNEL CODING DUALITY; SPARSE-GRAPH CODES;

CHANNEL CODING; ELECTRIC DISTORTION; ENCODING (SYMBOLS); GRAPH THEORY; SIGNAL DISTORTION;

DATA COMPRESSION;

EID: 65749088035     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2016040     Document Type: Article

References (23)

1. I. Csiszár and J. Körner, Information Theory, Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
2. G. Caire, S. Shamai (Shitz), and S. Verdú, "Lossless data compression with error correcting codes," in Advances in Network Information Theory. Providence, RI: Amer. Math. Soc., 2004, vol. 66, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 263-284.
3. T. Ancheta, "Bounds and Techniques for Linear Source Coding," Ph.D. dissertation, Dep. Elec. Eng., Univ. Notre Dame, Notre Dame, IN, 1977.
4. J. L. Massey, "Joint source and channel coding," Commun. Syst. Random Process Theory, vol. 11, pp. 279-293, 1978.
5. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Eaglewood Cliffs, NJ: Prentice-Hall, 1971.
6. J. Chen, D. He, and A. Jagmohan, "Achieving the rate-distortion bound with linear codes," in Proc. 2007 IEEE Information Theory Workshop Lake Tahoe, CA, Sep. 2007, pp. 662-667.
7. Y. Matsunaga and H. Yamamoto, "A coding theorem for lossy data compression by LDPC codes," IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2225-2229, Sep. 2003.
8. M. J.Wainwright and E. Maneva, "Lossy source encoding via message passing and decimation over generalized codewords of LDGM codes," in Proc. 2005 IEEE Int. Symp.Information Theory, Adelaide, Australia, Sep. 2005, pp. 1493-1497.
9. S. Ciliberti, K. Mezard, and R. Zecchina, "Message passing algorithms for non-linear nodes and data compression," ComPlexUs, vol. 3, pp. 58-65, Aug. 2006.
10. A. Braunstein, K. Mezard, and R. Zecchina, "Survey propagation: An algorithm for satisfiability," Random Structures and Algorithms, vol. 27, pp. 201-226, Mar. 2005.
11. E. Martinian and M. J. Wainwright, "Low-density codes achieve the rate-distortion bound," in Proc. 2006 Data Compression Conf., Snowbird, UT, Mar. 2006, pp. 153-162.
12. q by LDPC code," in Proc. 2006 IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 813-816.
13. S. Miyake and J. Muramatsu, "Construction of a lossy source code using LDPC matrices," in Proc. 2007 IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1106-1110.
14. E. Martinian and M. J.Wainwright, "Analysis ofLDGMand compound codes for lossy compression and binning," in Proc. 2006 Workshop on Information Theory and its Applications, La Jolla, CA, Feb. 2006.
15. S. Kudekar and R. Urbanke, "Lower bounds on the rate-distortion function of individual LDGM codes," in Proc. 5th Int. Symp. Turbo Codes and Related Topics, Lausanne, Switzerland, Sep. 2008, pp. 379-384.
16. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. New York: Wiley Interscience, 2006.
17. K. Azuma, "Weighted sums of certain dependent random variables," Tohoku Math. J., vol. 19, pp. 357-367, 1967.
18. A. Gupta and S. Verdú, "Nonlinear sparse-graph codes for lossy compression of discrete nonredundant sources," in Proc. 2007 IEEE Information Theory Workshop, Lake Tahoe, CA, Sep. 2007, pp. 541-546.
19. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
20. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. New York: Springer, 2004.
21. A. Dembo and I. Kontoyiannis, "Source coding, large deviations and approximate pattern matching," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1590-1615, Jun. 2002.
22. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the intractability of certain coding problems," IEEE Trans. Inf. Theory vol. IT-24, no. 3, pp. 384-386, May 1978.
23. T. M. Cover, "Enumerative source encoding," IEEE Trans. Inf. Theory vol. IT-10, no. 1, pp. 460-473, Jan. 1973.