Renormalization Group Approach To Error-Correcting Codes

Simple item page
dc.creatorYedidia, Jonathan
dc.creatorBouchaud, Jean-Philippe
dc.date2001-06-26
dc.date.accessioned2026-07-07T02:41:55Z
dc.date.available2026-07-07T02:41:55Z
dc.descriptionWe 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.
dc.description34 pages, 15 eps figure
dc.identifierhttps://arxiv.org/abs/cond-mat/0106540
dc.identifierhttp://arxiv.org/abs/cond-mat/0106540
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/17933
dc.subjectCondensed Matter
dc.titleRenormalization Group Approach To Error-Correcting Codes
dc.typetext

Files

Collections

arXiv