Nonlinear Sparse-Graph Codes for Lossy Compression

DOI10.1109/TIT.2009.2016040MaRDI QIDQ4975831zbMATH OpenOpenAlexFDO

Authors Ankit Gupta, Sergio Verdú

Publication date 8 August 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.2016040

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Sparse codes derived from graphs
• Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding
• On Lossy Compression of Directed Graphs
• Sparse hypergraphs with applications to coding theory
• Theoretical guarantees for graph sparse coding
• Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes
• Lossy Compression via Sparse Linear Regression: Performance Under Minimum-Distance Encoding
• Hypergraphs for Generic Lossless Image Compression
• Sparse factor graph representations of Reed-Solomon and related codes
• A Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage

Cited in

(3)

• Achievable complexity-performance tradeoffs in lossy compression
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Sparse codes derived from graphs

This page was built for publication: Nonlinear Sparse-Graph Codes for Lossy Compression

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