Burst erasure correcting LDPC codes

IEEE Transactions on Communications

Volumn 57, Issue 3, 2009, Pages 641-652

  Johnson, Sarah J ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Burst erasure channels; Burst erasure correcting codes; Erasure correcting codes; Low density parity check codes; Quasi cyclic codes

Indexed keywords

BLOCK CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); CONTROL THEORY; DECODING; MESSAGE PASSING; SIGNAL ENCODING; TURBO CODES;

BURST ERASURE CHANNELS; BURST ERASURE CORRECTING CODES; ERASURE-CORRECTING CODES; LOW-DENSITY PARITY-CHECK CODES; QUASI-CYCLIC CODES;

REAL TIME SYSTEMS;

EID: 63649138225     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.03.060468     Document Type: Article

References (27)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
3. M. Yang and W. E. Ryan, "Design of LDPC codes for two-state fading channel models," in Proc. 5th Int. Symp. Wireless Personal Multimedia Communications, Oct. 2002, pp. 193-197.
4. M. Yang, "Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel," IEEE Trans. Magn., vol. 40, no. 2, pp. 507-512, Mar. 2004.
5. H. Song and J. R. Cruz, "Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording," IEEE Trans. Magn., vol. 39, no. 2, pp. 1081-1087, Mar. 2003.
6. Y. Y. Tai, L. Lan, L. Zeng, S. Lin, and K. A. S. Abdel-Ghaffar, "Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels," IEEE Trans. Commun., vol. 54, no. 10, pp. 1765-1774, 2006.
7. F. Peng, M. Yang, and W. E. Ryan, "Simplified eIRA code design and performance analysis for correlated Rayleigh fading channels," IEEE Trans. Wireless Commun., vol. 5, no. 4, pp. 720-725, Apr. 2006.
8. E. Paolini and M. Chiani, "Improved low-density parity-check codes for burst erasure channels," in Proc. International Conference on Communications ICC, Istanbul, Turkey, June 2006.
9. G. Hosoya, H. Yagi, T. Matsushima, and S. Hirasawa, "A modification method for constructing low-density parity-check codes for burst erasures," ICICE Trans. Fundamentals, vol. E89-A, no. 10, pp. 2501-2509, Oct. 2006.
10. M. P. C. Fossorier, "Universal burst error correction," in Proc. International Symposium on Information Theory, ISIT'2006, Seattle USA July 2006, pp. 1969-1973.
11. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
12. 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.
13. G. D. Forney, "Burst-correcting codes for the classic bursty channel," Trans. Comms, vol. 19, no. 5, pp. 772-781, Oct. 1971.
14. W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes Cambridge University Press, 2003.
15. R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, June 2000.
16. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
17. S. J. Johnson and S. R. Weller, "Resolvable 2-designs for regular low-density parity-check codes," IEEE Trans. Commun., vol. 51, no. 9, pp. 1413-1419, Sept. 2003.
18. S. J. Johnson, "Codes for iterative decoding from partial geometries," IEEE Trans. Comms, vol. 52, no. 2, pp. 236-243, Feb. 2004.
19. J. Xu and S. Lin, "A combinatoric superposition method for constructing LDPC codes," in Proc. International Symposium on Information Theory (ISIT'2003), Yokohama, Japan, June 2003, p. 30.
20. Z. Li, L. Chen, L. Zeng, S. Lin, and W. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun. vol. 53, no. 11, pp. 1973-1973, Nov. 2005.
21. S. J. Johnson, "Erasure correcting LDPC codes for channels with packet losses," in NEWCOM ACoRN Joint Workshop, Vienna, Austria, Sept. 2006.
22. S. Lin, An Introduction to Error Correcting Codes, ser. Prentice-Hall Electrical Engineering Series. Englewood Cliffs, NJ: Prentice-Hall, Inc., 1970.
23. B. Vasic, "Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording," in Proc. IEEE Globecom Conf., San Antonio, TX, Nov. 2001, pp. 2954-2960.
24. S. J. Johnson and S. R. Weller, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, no. 2, pp. 79-81, Feb. 2003.
25. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inform. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
26. M. Yang and W. E. Ryan, "Lowering the error rate floors of moderate-length high-rate LDPC codes," in Proc. International Symposium on Information Theory (ISIT'2003), June 2003, p. 237.
27. R. M. Neal, .