2000 character limit reached
Beyond the Bethe Free Energy of LDPC Codes via Polymer Expansions
Published 13 Feb 2012 in cs.IT, cond-mat.stat-mech, math-ph, math.IT, and math.MP | (1202.2774v1)
Abstract: The loop series provides a formal way to write down corrections to the Bethe entropy (and/or free energy) of graphical models. We provide methods to rigorously control such expansions for low-density parity-check codes used over a highly noisy binary symmetric channel. We prove that in the asymptotic limit of large size, with high probability, the Bethe expression gives an exact formula for the entropy (per bit) of the input word conditioned on the output of the channel. Our methods also apply to more general models.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.