A coding theorem for lossy data compression by LDPC codes
From MaRDI portal
Publication:3547348
DOI10.1109/TIT.2003.815805zbMath1301.94055OpenAlexW2160567110MaRDI QIDQ3547348
Hirosuke Yamamoto, Yuko Matsunaga
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.815805
Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)
Related Items (2)
Achievable complexity-performance tradeoffs in lossy compression ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
This page was built for publication: A coding theorem for lossy data compression by LDPC codes