Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding
Authors:
- Gianluigi LivaGLGianluigi Liva
- Balazs MatuzBMBalazs Matuz
- Marco ChianiMCMarco Chiani
- 13 June 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 12 (6) , 450-452
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 isin= 0.450, where an ideal (2048,1024) MDS code would reach the same error rate at isin = 0.453.Keywords
This publication has 11 references indexed in Scilit:
- Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters]IEEE Transactions on Communications, 2008
- Weight Distribution of Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2006
- Simple reconfigurable low-density parity-check codesIEEE Communications Letters, 2005
- Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 2005
- An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure ChannelIEEE Transactions on Information Theory, 2004
- Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC CodesIEEE Transactions on Communications, 2004
- On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure ChannelIEEE Transactions on Information Theory, 2004
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978