The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number

Simple item page
dc.creatorMori, Ryuhei
dc.creatorKasai, Kenta
dc.creatorShibuya, Tomoharu
dc.creatorSakaniwa, Kohichi
dc.date2008-01-07
dc.date2008-01-23
dc.date.accessioned2026-07-07T08:55:46Z
dc.date.available2026-07-07T08:55:46Z
dc.descriptionWe consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is well known that a difference between the bit error probability at finite iteration number for finite block length $n$ and for infinite block length is asymptotically $α/n$, where $α$ is a specific constant depending on the degree distribution, the iteration number and the erasure probability. Our main result is to derive an efficient algorithm for calculating $α$ for regular ensembles. The approximation using $α$ is accurate for $(2,r)$-regular ensembles even in small block length.
dc.description5 pages, 6 figures, correcting errors in Theorem 1 and poor English
dc.identifierhttps://arxiv.org/abs/0801.0931
dc.identifierhttp://arxiv.org/abs/0801.0931
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146380
dc.subjectInformation Theory
dc.titleThe Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number
dc.typetext

Files

Collections

arXiv