Lossy data compression with random gates
S. Ciliberti 1, M. Mezard 1, R. Zecchina 2 Physical Review Letters 95 (2005) 038701 We introduce a new protocol for a lossy data compression algorithm which is based on constraint satisfaction gates. We show that the theoretical capacity of algorithms built from standard parity-check gates converges exponentially fast to the Shannon\’s bound when the number of variables seen by each […]
Lossy data compression with random gates Lire la suite »