1 paper · 1 filter
Jonathan Yedidia, Jean-Philippe Bouchaud
We explain an algorithm that approximately but efficiently assesses particular parity-check error-correcting codes of large, but finite, blocklength. This algorithm is based on the…