2001/06/26 by Jonathan S. Yedidia, Jonathan Yedidia, Yedidia, Jonathan +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Coding theory and cryptography #Condensed Matter (cond-mat) #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Physical sciences #cond-mat
paper · pdf · doi:10.48550/arxiv.cond-mat/0106540
34 pages, 15 eps figure
arxiv created 2001/06/26 · openalex publication_date 2001/06/26 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 ``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. This assessment algorithm can be used as a subroutine in a more general algorithm to search for optimal error-correcting codes of specified blocklength and rate.