Computer Science – Information Theory
Scientific paper
2009-01-28
In: IEEE International Symposium on Information Theory, 2009. ISIT 2009. Seul, Korea; 2009
Computer Science
Information Theory
5 pages, 3 figures
Scientific paper
In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(
Braunstein Alfredo
Kayhan Farbod
Zecchina Riccardo
No associations
LandOfFree
Efficient LDPC Codes over GF(q) for Lossy Data Compression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient LDPC Codes over GF(q) for Lossy Data Compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient LDPC Codes over GF(q) for Lossy Data Compression will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-344895