By Topic

Nonlinear Sparse-Graph Codes for Lossy Compression of Discrete Nonredundant Sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gupta, A. ; Princeton Univ., Princeton ; Verdú, S.

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.

Published in:

Information Theory Workshop, 2007. ITW '07. IEEE

Date of Conference:

2-6 Sept. 2007