A Coding Theorem for Lossy Data Compression by LDPC Codes

IEEE Transactions on Information Theory

Volumn 49, Issue 9, 2003, Pages 2225-2229

  Matsunaga, Yuko ^a   Yamamoto, Hirosuke ^b  

^a NEC CORPORATION   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Lossy data compression; Low density parity check (LDFC) codes; Rate distortion function

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); MATRIX ALGEBRA;

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

DATA COMPRESSION;

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

References (19)

1. R. G. Gallager, "Low density parity check codes," IEEE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. _, Low Density Parity Check Codes, ser. Research Monograph. Cambridge, MA: MIT Press, 1963.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999. see also the correction: IEEE Trans. Inform. Theory, vol. 47, pp. 2101, July, 2001.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999. see also the correction: IEEE Trans. Inform. Theory, vol. 47, pp. 2101, July, 2001.
5. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
7. T. Richardson, A. Shokrollahi, and R. Urbanke, "The capacity of low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47. pp. 599-618, Feb. 2001.
8. _, "Design of provably good low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
9. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
10. J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan Kaufmann, 1988.
11. B. J. Frey, Graphical Models for Machine Learning and Digital Communication. Cambridge, MA: MIT Press, 1998.
12. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2696-2710, Nov. 2001.
13. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
14. I. Csiszár and J. Körner, Information Theroy, Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
15. T. J. Goblick, "Coding for a discrete information source with a distortion measure," Ph.D. dissertation, Dept. Elec. Eng., MIT, Cambridge, MA, 1962.
16. T. Berger, Rate Distortion Theory, A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
17. A. J. Viterbi and J. K. Omura, "Trellis encoding of memoryless discrete-time sources with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-20, pp. 325-332, May 1974.
18. M. Kac, "Random walk and the theory of Brownian motion," Amer. Math. Monthly, vol. 54, pp. 369-391, 1947.
19. G. Letac and L. Takacs, "Random walk on the m-dimensional cube," J. Reine Angrew. Math., vol. 310, pp. 187-195, 1979.