arXiv · cond-mat/0506652
The theoretical capacity of the Parity Source Coder
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stefano Ciliberti, Marc Mezard. 2005-09-14. The theoretical capacity of the Parity Source Coder. https://doi.org/10.1088/1742-5468%2F2005%2F10%2Fp10003
Cite the original work for its findings. Save a collection to share your selection of sources.