Nonlinear sparse-graph codes for lossy compression of discrete nonredundant sources

Ankit Gupta, Sergio Verdú

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

We propose a scheme to implement lossy data compression for discrete equiprobable sources using block codes based on sparse matrices. We prove asymptotic optimality of the codes for a Hamming distortion criterion. We also present a sub-optimal decoding algorithm, which has near optimal performance for moderate blocklengths.

Original languageEnglish (US)
Title of host publication2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
Pages541-546
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 IEEE Information Theory Workshop, ITW 2007 - Lake Tahoe, CA, United States
Duration: Sep 2 2007Sep 6 2007

Publication series

Name2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Other

Other2007 IEEE Information Theory Workshop, ITW 2007
CountryUnited States
CityLake Tahoe, CA
Period9/2/079/6/07

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Information Systems
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Nonlinear sparse-graph codes for lossy compression of discrete nonredundant sources'. Together they form a unique fingerprint.

  • Cite this

    Gupta, A., & Verdú, S. (2007). Nonlinear sparse-graph codes for lossy compression of discrete nonredundant sources. In 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings (pp. 541-546). [4313132] (2007 IEEE Information Theory Workshop, ITW 2007, Proceedings). https://doi.org/10.1109/ITW.2007.4313132