Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes

Simple item page
dc.creatorAmraoui, Abdelaziz
dc.creatorMontanari, Andrea
dc.creatorRichardson, Tom
dc.creatorUrbanke, Rudiger
dc.date2004-10-10
dc.date.accessioned2026-07-07T08:15:15Z
dc.date.available2026-07-07T08:15:15Z
dc.descriptionConsider communication over the binary erasure channel BEC using random low-density parity-check codes with finite-blocklength n from `standard' ensembles. We show that large error events is conveniently described within a scaling theory, and explain how to estimate heuristically their effect. Among other quantities, we consider the finite length threshold e(n), defined by requiring a block error probability P_B = 1/2. For ensembles with minimum variable degree larger than two, the following expression is argued to hold e(n) = e -e_1 n^{-2/3} +Θ(n^{-1}) with a calculable shift} parameter e_1>0.
dc.description42nd Allerton Conference on Communication, Control and Computing (invited paper)
dc.identifierhttps://arxiv.org/abs/cs/0410019
dc.identifierhttp://arxiv.org/abs/cs/0410019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133390
dc.subjectInformation Theory
dc.subjectDisordered Systems and Neural Networks
dc.titleFinite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes
dc.typetext

Files

Collections

arXiv