The theoretical capacity of the Parity Source Coder
Stefano Ciliberti, Marc Mezard
Abstract
The Parity Source Coder is a protocol for data compression which is based on a set of parity checks organized in a sparse random network. We consider here the case of memoryless unbiased binary sources. We show that the theoretical capacity saturate the Shannon limit at large K. We also find that the first corrections to the leading behavior are exponentially small, so that the behavior at finite K is very close to the optimal one.
Create a lesson
Related papers
Deep Learning of Phase Transitions for Bilinear-Biquadratic Spin-1 Chains from Correlation Aspects
Ming-Chiang Chung, Yu-Ting Kuo, Ian McCulloch et al.
Resolving Structural Uncertainty in Stochastic Dynamical Systems via Ensemble-Based Bayesian Inference
Francesco Zambelli, Valeria D'Andrea, Manlio De Domenico
Seismology of Glasses
Zhiyu Cao, Peter G. Wolynes
Orbital cancellation and reentrant localization in a quasiperiodic trimer ladder
Xin Wang, Pei-Jie Chang, Quanfeng Lu et al.
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.
Eigenstate transitions and critical transport in 3D Aubry-André model
Pragna Das, Lev Vidmar, Miroslav Hopjan