The theoretical capacity of the Parity Source Coder
<|reference_start|>The theoretical capacity of the Parity Source Coder: 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.<|reference_end|>
@article{ciliberti2005the,
    title={The theoretical capacity of the Parity Source Coder},
    author={Stefano Ciliberti, Marc Mezard},
    journal={J. Stat Mech P10003 (2005)},
    year={2005},
    doi={10.1088/1742-5468/2005/10/P10003},
    archivePrefix={arXiv},
    eprint={cond-mat/0506652},
    primaryClass={cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT}
}