Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms

DOI10.1109/TIT.2009.2039160MaRDI QIDQ4975985zbMATH OpenOpenAlexFDO

Authors Martin J. Wainwright, Elitza Maneva, Emin Martinian

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2039160

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(5)

• The satisfiability threshold for random linear equations
• Basics of secrecy coding
• Compressors for combined source and channel coding with applications to the generalized Gaussian family (Corresp.)
• The full rank condition for sparse random matrices
• HQC beyond the standard: ciphertext compression and refined DFR analysis

This page was built for publication: Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms

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