Doubly generalized LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 669-672

  Wang, Yige ^a   Fossorier, Marc ^a  

^a University of Hawaii at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT NODES; GENERALIZED LOW-DENSITY PARITY-CHECK (GLDPC) CODES;

PARAMETER ESTIMATION;

CODES (SYMBOLS);

EID: 39049109230     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261869     Document Type: Conference Paper

References (17)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
3. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
4. M. Lentmaier and K. S. Zigangirov, "On generalized low-density parity-check codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, pp. 248-250, Aug. 1999.
5. J. Boutros, O. Pothier, and G. Zemor, "Generalized low density (Tanner) codes," Proc. of Int. Conf. Commun., vol. 1, pp. 441-445, Jun. 1999.
6. N. Miladinovic and M. Fossorier, "Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels," Proc. of Global Telecommun. Conf., St. Louis, USA, Nov. 2005.
7. G. Yue, L. Ping, and X. Wang, "Low-rate generalized low-density parity-check codes with Hadamard contraints," Proc. IEEE Int. Symp. Inform. Theory, Adelaide, Australia, pp. 1377-1381, Sep. 2005.
8. J. Chen and R. M. Tanner, "A hybrid coding scheme for the Gilbert-Elliot channel," Proc. 42th Allerton Conf. on Commun., Control and Computing, Monticello, USA, Sep. 2004.
9. S. Abu-Surra, G. Liva, and W. Ryan, "Low-floor Tanner codes via Hamming-node or RSCC-node doping," Proc. Applied Algebra, Algebraic Algorithms and Error Correcting Codes-16 Conference, Las Vegas, USA, Feb. 2006.
10. S. Dolinar, "Design and iterative decoding of networks of many small codes," Proc. IEEE Int. Symp. Inform. Theory, Yokohama, Japan, p. 381, Jun. 2003.
11. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Inform. Theory, vol. 49, pp. 1727-1737, Oct. 2001.
12. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
13. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
14. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic Information Transfer Functions: Model and Erasure Channel Properties," IEEE Trans. Inform. Theory, vol. 50, pp. 2657-2673, Nov. 2004.
15. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, pp. 670-678, Apr. 2004.
16. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, vol. 51, pp. 386-398, Jan. 2005.
17. LDPCopt, an efficient optimization program for LDPC codes. [Online]. Available: http://lthcwww.epfl.ch/research/ldpcopt/.