222 citations · 454 across the 7 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
cond-mat.dis-nn2005★ 18 cited
Message passing algorithms for non-linear nodes and data compression
S. Ciliberti, M. Mezard, R. Zecchina
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 excel…
cond-mat.dis-nn2005★ 222 cited
Clustering of solutions in the random satisfiability problem
M. Mezard, T. Mora, R. Zecchina
Using elementary rigorous methods we prove the existence of a clustered phase in the random -SAT problem, for . In this phase the solutions are grouped into clusters wh…