Stefano Ciliberti and Marc Mézard J. Stat. Mech. (2005) P10003 doi:10.1088/1742-5468/2005/10/P10003
Stefano Ciliberti and Marc Mézard
Show affiliationsThe 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 saturates the Shannon limit at large K. We also find that the first corrections to the leading behaviour are exponentially small, with the result that the behaviour at finite K is very close to the optimal one.
E-print Number: cond-mat/0506652
Cited: by |
Refers: to
84.40.Ua Telecommunications: signal transmission and processing; communication satellites
02.10.Ox Combinatorics; graph theory
89.70.-a Information and communication theory
05.40.-a Fluctuation phenomena, random processes, noise, and Brownian motion
05C85 Graph algorithms (See also 68R10, 68W05)
Issue 10 (October 2005)
Received 24 June 2005, accepted for publication 21 September 2005
Published 6 October 2005
Stefano Ciliberti and Marc Mézard J. Stat. Mech. (2005) P10003
G Santhosh et al J. Stat. Mech. (2005) P07005
Alexander L Korzhenevskii et al J. Stat. Mech. (2008) P04013
A M Povolotsky and V B Priezzhev J. Stat. Mech. (2006) P07002
Massimo Ostilli J. Stat. Mech. (2007) P09010
J-P Kownacki J. Stat. Mech. (2008) P07024
Jan de Gier and Fabian H L Essler J. Stat. Mech. (2006) P12011
A Puglisi et al J. Stat. Mech. (2007) P08016
Adriano Barra and Luca De Sanctis J. Stat. Mech. (2007) P08025
Pascal Baseilhac and Kozo Koizumi J. Stat. Mech. (2005) P10005