Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polymer Expansions for Cycle LDPC Codes

Published 13 Feb 2012 in cs.IT, cond-mat.stat-mech, math-ph, math.IT, and math.MP | (1202.2778v1)

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.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.