Generalized IRA erasure correcting codes for hybrid iterative/maximum likelihood decoding

34Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The design of low-density parity-check (LDPC) codes under hybrid iterative/maximum likelihood decoding is addressed for the binary erasure channel (BEC). Specifically, we focus on generalized irregular repeat-accumulate (GeIRA) codes, which offer both efficient encoding and design flexibility. We show that properly designed GeIRA codes tightly approach the performance of an ideal maximum distance separable (MDS) code, even for short block sizes. For example, our (2048, 1024) code reaches a codeword error rate of 10-5 at channel erasure probability ε = 0.450, where an ideal (2048, 1024) MDS code would reach the same error rate at ε = 0.453. © 2008 IEEE.

Cite

CITATION STYLE

APA

Paolini, E., Liva, G., Matuz, B., & Chiani, M. (2008). Generalized IRA erasure correcting codes for hybrid iterative/maximum likelihood decoding. IEEE Communications Letters, 12(6), 450–452. https://doi.org/10.1109/LCOMM.2008.080221

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free