Jonathan S Yedidia and Jean-Philippe Bouchaud 2003 J. Phys. A: Math. Gen. 36 1267 doi:10.1088/0305-4470/36/5/306
Jonathan S Yedidia1 and Jean-Philippe Bouchaud2
Show affiliationsWe explain an algorithm that approximately but efficiently assesses the performance of belief propagation decoding for particular parity check error-correcting codes of large, but finite, blocklength. This algorithm is based on the renormalization group approach from physics: the idea is to continually replace an error-correcting code with a simpler error-correcting code that has nearly identical performance, until the code is reduced to a small enough size that its performance can be computed exactly.
Issue 5 (7 February 2003)
Received 15 May 2002, in final form 31 October 2002
Published 22 January 2003
Jonathan S Yedidia and Jean-Philippe Bouchaud 2003 J. Phys. A: Math. Gen. 36 1267
Philippe Curty and Matteo Marsili J. Stat. Mech. (2006) P03013
G Logan DesAutels et al 2003 J. Opt. A: Pure Appl. Opt. 5 96
V N Tsytovich et al 2007 New J. Phys. 9 263
R Jordan 1995 Nonlinearity 8 585
Andrew Ross and H Damon Matthews 2009 Environ. Res. Lett. 4 045103
T D Scheibe et al 2007 J. Phys.: Conf. Ser. 78 012063
Xiaoyong Deng et al 2009 Nanotechnology 20 115101