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

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

2004-10-10

arxiv.org/abs/cs/0410019v1

Computer Science

Information Theory

42nd Allerton Conference on Communication, Control and Computing (invited paper)

Scientific paper

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} +\Theta(n^{-1}) with a calculable shift} parameter e_1>0.

Affiliated with

Also associated with

No associations

Rating

Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358546