A coding theorem for lossy data compression by LDPC codes

DOI10.1109/TIT.2003.815805zbMATH Open1301.94055OpenAlexW2160567110MaRDI QIDQ3547348FDOQ3547348

Authors: Yuko Matsunaga, Hirosuke Yamamoto 

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

Recommendations

• Low-Density Parity-Check Matrices for Coding of Correlated Sources
• scientific article; zbMATH DE number 2226643
• Efficient encoding of low-density parity-check codes
• On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
• scientific article; zbMATH DE number 2086429

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)

Cited In (10)

• The typical performance of irregular low-density generator-matrix codes for lossy compression
• LDGM codes for channel coding and joint source-channel coding of correlated sources
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mismatched codebooks and the role of entropy coding in lossy data compression
• Low-Density Parity-Check Matrices for Coding of Correlated Sources
• The theoretical capacity of the parity source coder
• Achievable complexity-performance tradeoffs in lossy compression
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Rate-adaptive codes for distributed source coding

This page was built for publication: A coding theorem for lossy data compression by LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547348)