Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources

Details Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources

2011-07-08

arxiv.org/abs/1107.1609v2

J. Phys. Soc. Jpn., 80, 9 093801 (2011)

Computer Science

Information Theory

4 pages, 1 figure

Scientific paper

10.1143/JPSJ.80.093801

A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal performance for moderate block lengths.

Affiliated with

Also associated with

No associations

Rating

Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources 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 Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222184