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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Consider 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.
42nd Allerton Conference on Communication, Control and Computing (invited paper)

Keywords

Information Theory, Disordered Systems and Neural Networks

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133390

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0410019
 http://arxiv.org/abs/cs/0410019

Collections

arXiv