By Topic

A coding theorem for lossy data compression by LDPC codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. Matsunaga ; Dept. of Math. Eng. & Inf. Phys., Tokyo Univ., Japan ; H. Yamamoto

Recently, low density parity check (LDPC) codes have been studied actively because of the high performance of error correction. Many previous researches showed that LDPC codes can attain near the Shannon limit by iterative decoding with belief propagation. On the other hand, it is well known that channel coding can be considered as the dual problem of lossy source coding in the rate-distortion theory, and a good error correcting code can be used for efficient lossy data compression. In this paper, we show that LDPC codes can also attain the rate-distortion function asymptotically for the same source.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002