Low-complexity error correction of Hamming-code-based LDPC codes

Problems of Information Transmission

Volumn 45, Issue 2, 2009, Pages 95-109

  Zyablov, V A ^a   Johannesson, R ^b   Loncar M ^c  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b LUND UNIVERSITY   (Sweden)

^c Nokia Danmark AS   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SYMMETRIC CHANNEL; CODE LENGTH; CODE PARAMETERS; GILBERT-VARSHAMOV BOUND; HAMMING CODE; ITERATIVE DECODER; LDPC CODES; LOGARITHMIC FUNCTIONS; LOW-COMPLEXITY; NUMBER OF ITERATIONS; NUMERICAL EXAMPLE;

BLOCK CODES; ITERATIVE DECODING;

ERROR CORRECTION;

EID: 67749104169     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1134/S0032946009020021     Document Type: Article

References (15)

1. Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost'yu proverok na chetnost', Moscow: Mir, 1966.
2. Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 9, pp. 533-547.
3. Zyablov, V.V. and Pinsker, M.S., Estimation of the Error-Correction Complexity for Gallager Low-Density Codes, Probl. Peredachi Inf., 1975, vol. 11, no. 1, pp. 23-36 [Probl. Inf. Trans. (Engl. Transl.), 1975, vol. 11, no. 1, pp. 18-28].
4. Bassalygo, L.A., Formalization of the Problem of Complexity of Code Specification, Probl. Peredachi Inf., 1976, vol. 12, no. 4, pp. 105-106 [Probl. Inf. Trans. (Engl. Transl.), 1976, vol. 12, no. 4, pp. 322-324].
5. Boutros, J., Pothier, O., and Zémor, G., Generalized Low Density (Tanner) Codes, in Proc. IEEE Int. Conf. on Communications (ICC), Vancouver, Canada, 1999, vol. 1, pp. 441-445.
6. Lentmaier, M. and Zigangirov, K., Iterative Decoding of Generalized Low-Density Parity-Check Codes, in Proc. 1998 IEEE Int. Sympos. on Information Theory, Cambridge, USA, Pscataway, 1998.
7. Lentmaier, M. and Zigangirov, K., On Generalized Low-Density Parity-Check Codes Based on Hamming Component Codes, IEEE Commun. Letters, 1999, vol. 3, no. 8, pp. 248-250.
8. Miladinović, N. and Fossorier, M., Generalized LDPC Codes with Reed-Solomon and BCH Codes as Component Codes for Binary Channels, in Proc. IEEE Conf. on Global Telecommunications (GLOBECOM 2005), St. Louis, USA, 2005, pp. 591-596.
9. Bilu, Y. and Hoory, S., On Codes from Hypergraphs, European J. Combin., 2004, vol. 25, pp. 339-354.
10. Sipser, M. and Spielman, D.A., Expander Codes, IEEE Trans. Inform. Theory, 1996, vol. 42, no. 6, pp. 1710-1722.
11. Zémor, G., On Expander Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 835-837.
12. Barg, A. and Zémor, G., Error Exponents of Expander Codes, IEEE Trans. Inform. Theory, 2002, vol. 48, no. 6, pp. 1725-1729.
13. Bassalygo, L.A., Asymptotically Optimal Switching Circuits, Probl. Peredachi Inf., 1981, vol. 17, no. 3, pp. 81-88 [Probl. Inf. Trans. (Engl. Transl.), 1981, vol. 17, no. 3, pp. 206-211].
14. Stiglmayr, S. and Zyablov, V.V., Asymptotically Good Low-Density Codes Based on Hamming Codes, in Proc. 11th Int. Sympos. on Problems of Redundancy in Information and Control Systems, St. Petersburg, Russia, 2007, pp. 98-103. Available at http://www.k36.org/redundancy2007/ proceedings.php.
15. Zyablov, V., Lončar, M., and Johannesson, R., On the Expanding Properties of Gallager's LDPC Matrices, in Proc. Int. Workshop "Coding Theory Days in St. Petersburg," St. Petersburg, Russia, 2008, pp. 40-50.