2000 character limit reached
Polymer Expansions for Cycle LDPC Codes (1202.2778v1)
Published 13 Feb 2012 in cs.IT, cond-mat.stat-mech, math-ph, math.IT, and math.MP
Abstract: We prove that the Bethe expression for the conditional input-output entropy of cycle LDPC codes on binary symmetric channels above the MAP threshold is exact in the large block length limit. The analysis relies on methods from statistical physics. The finite size corrections to the Bethe expression are expressed through a polymer expansion which is controlled thanks to expander and counting arguments.