A coding theorem for lossy data compression by LDPC codes
Yuko Matsunaga and Hirosuke Yamamoto
- In this correspondence, LDPC codes are applied to lossy source coding and it is studied how the asymptotic performance of MacKay's LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary i.i.d.~source with $\Pr\{x=1\}=0.5$. In the sequel, it is shown that an LDPC code with column weight $O(\log n)$ for code length $n$ can attain the rate-distortion function asymptotically.
- Key words: LDPC codes, lossy data compression, rate-distortion function.
- DOI: 10.1109/TIT.2003.815805