Message passing algorithms for non-linear nodes and data compression

Details Message passing algorithms for non-linear nodes and data compression Message passing algorithms for non-linear nodes and data compression

2005-08-30

arxiv.org/abs/cond-mat/0508723v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

13 pages, European Conference on Complex Systems, Paris (Nov 2005)

Scientific paper

The use of parity-check gates in information theory has proved to be very efficient. In particular, error correcting codes based on parity checks over low-density graphs show excellent performances. Another basic issue of information theory, namely data compression, can be addressed in a similar way by a kind of dual approach. The theoretical performance of such a Parity Source Coder can attain the optimal limit predicted by the general rate-distortion theory. However, in order to turn this approach into an efficient compression code (with fast encoding/decoding algorithms) one must depart from parity checks and use some general random gates. By taking advantage of analytical approaches from the statistical physics of disordered systems and SP-like message passing algorithms, we construct a compressor based on low-density non-linear gates with a very good theoretical and practical performance.

Affiliated with

Also associated with

No associations

Rating

Message passing algorithms for non-linear nodes and 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 Message passing algorithms for non-linear nodes and data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message passing algorithms for non-linear nodes and data compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20437