Renormalization Group Approach To Error-Correcting Codes
凝聚态物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.cond-mat/0106540,
title = {Renormalization Group Approach To Error-Correcting Codes},
author = {Jonathan Yedidia and Jean-Philippe Bouchaud},
journal= {arXiv preprint arXiv:cond-mat/0106540},
year = {2007}
}
备注
34 pages, 15 eps figure