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

IEEE Communications Letters

Volumn 12, Issue 6, 2008, Pages 450-452

  Paolini, Enrico ^a   Liva, Gianluigi ^b   Matuz, Balazs ^b   Chiani, Marco ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

Author keywords

Binary erasure channel; Iterative decoding; LDPC codes; Maximum likelihood decoding; Packet erasure correcting codes

Indexed keywords

CODES (STANDARDS); DECODING; ERROR ANALYSIS;

BINARY ERASURE CHANNEL (BEC); BLOCK SIZES; CODEWORD ERROR RATE (CWER); DESIGN FLEXIBILITY; EFFICIENT ENCODING; ERASURE CORRECTING; IRREGULAR REPEAT-ACCUMULATE (EIRA); LOW DENSITY PARITY-CHECK (LDPC) CODES; MAXIMUM DISTANCE;

CODES (SYMBOLS);

EID: 46349104492     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2008.080221     Document Type: Article

References (14)

1. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Inform. Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
2. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
3. D. Burshtein and G. Miller, "An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2837-2844, Nov. 2004.
4. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Inform. Theory vol. 50, no. 3, pp. 439-454, Mar. 2004.
5. G. Liva, E. Paolini, and M. Chiani, "Simple reconfigurable low-density parity-check codes," IEEE Commun. Lett., vol. 9, no. 3, pp. 258-260, Mar. 2005.
6. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. 24, no. 3, pp. 384-386, May 1978.
7. Y. Han, W. E. Ryan, and R. D. Wesel, "Dual-mode decoding of product codes with application to tape storage," in Proc. IEEE 2005 Global Communications Conf., vol. 3, St. Louis, USA, Nov. 2005.
8. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
9. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. Int. Symp. on Turbo codes and Related Topics, Brest, France, Sept. 2000, pp. 1-8.
10. M. Yang, Y. Li, and W. E. Ryan, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun. vol. 52, no. 4, pp. 564-571, Apr. 2004.
11. C. Di, T. Richardson, and R. Urbanke, "Weight distribution of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 4839-4855, Nov. 2006.
12. S. Johnson and S. Weller, "Combinatorial interleavers for systematic regular repeat-accumulate codes," IEEE Trans. Commun., to appear.
13. X. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, no. 1, pp. 386-398, Jan. 2005.
14. X.-Y. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE Int. Conf. on Communications, vol. 2, Paris, France, June 2004, pp. 767-771.