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

Ankit Gupta, Sergio Verdu
2007 2007 IEEE Information Theory Workshop  
We propose a scheme for lossy compression of discrete memoryless sources: The compressor is the decoder of a nonlinear channel code, constructed from a sparse graph. We prove asymptotic optimality of the scheme for any separable (letter-by-letter) bounded distortion criterion. We also present a suboptimal compression algorithm, which exhibits near-optimal performance for moderate block lengths.
doi:10.1109/itw.2007.4313132 fatcat:fknagoh3pnd3hlo77iwobbh45e