Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC

Simple item page
dc.creatorPaolini, Enrico
dc.creatorLiva, Gianluigi
dc.creatorVarrella, Michela
dc.creatorMatuz, Balazs
dc.creatorChiani, Marco
dc.date2008-04-18
dc.date.accessioned2026-07-07T09:33:27Z
dc.date.available2026-07-07T09:33:27Z
dc.descriptionRecent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure channel. Such result is achievable down to low error rates, even for small and moderate block sizes, while keeping the decoding complexity low, thanks to a class of decoding algorithms which exploits the sparseness of the parity-check matrix to reduce the complexity of Gaussian elimination (GE). In this paper the main concepts underlying ML decoding of LDPC codes are recalled. A performance analysis among various LDPC code classes is then carried out, including a comparison with fixed-rate Raptor codes. The results show that LDPC and Raptor codes provide almost identical performance in terms of decoding failure probability vs. overhead.
dc.description2008 Advanced Satellite Mobile Systems Conference. 9 pages, 12 figures
dc.identifierhttps://arxiv.org/abs/0804.2991
dc.identifierhttp://arxiv.org/abs/0804.2991
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159139
dc.subjectInformation Theory
dc.titleLow-Complexity LDPC Codes with Near-Optimum Performance over the BEC
dc.typetext

Files

Collections

arXiv