Message passing algorithms for non-linear nodes and data compression

Simple item page
dc.creatorCiliberti, S.
dc.creatorMezard, M.
dc.creatorZecchina, R.
dc.date2005-08-30
dc.date.accessioned2026-07-07T03:06:27Z
dc.date.available2026-07-07T03:06:27Z
dc.descriptionThe 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.
dc.description13 pages, European Conference on Complex Systems, Paris (Nov 2005)
dc.identifierhttps://arxiv.org/abs/cond-mat/0508723
dc.identifierhttp://arxiv.org/abs/cond-mat/0508723
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/26814
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleMessage passing algorithms for non-linear nodes and data compression
dc.typetext

Files

Collections

arXiv