New low-density parity-check codes with large girth based on hypergraphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 819-823

  Bocharova, Irina E ^a   Hug, Florian ^a   Johannesson, Rolf ^a   Kudryashov, Boris D ^b   Satyukov, Roman V ^b  

^a ITMO UNIVERSITY   (Russian Federation)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; COMPACT REPRESENTATION; HYPER GRAPH; LDPC CODES; LOW-DENSITY PARITY-CHECK CODES; MINIMUM DISTANCE; QUASI-CYCLIC;

CODING ERRORS; COMPUTER PROGRAMMING; CONVOLUTIONAL CODES; GRAPH THEORY; INFORMATION THEORY; OPTIMIZATION;

FREQUENCY SELECTIVE FADING;

EID: 77955699261     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513639     Document Type: Conference Paper

References (18)

1. G. Schmidt, V. V. Zyablov, and M. Bossert, "On expander codes based on hypergraphs," in Proc. IEEE International Symposium on Information Theory (ISIT'03), Yokohama, Japan, Jun. 29 - Jul. 4, 2003, p. 88.
2. A. Barg and G. Zemor, "Distance properties of expander codes," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 78-90, Jan. 2006.
3. I. E. Bocharova, R. Johannesson, B. D. Kudryashov, and V. V. Zyablov, "Woven graph codes: Asymptotic performances and examples," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 121-129, Jan. 2010.
4. A. Shokrollahi, "LDPC codes: An introduction," in Coding, cryptography, and combinatorics, ser. Progress in Computer Science and Applied Logic (PCS), K. Feng, H. Niederreiter, and C. Xing, Eds. Basel, Switzerland: Birkhäuser Verlag, 2004, vol. 23, pp. 85-110.
5. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Dec. 2004.
6. R. M. Tanner, "A [155, 64, 20] sparse graph (LDPC) code," presented at the Recent Results Session at IEEE International Symposium on Information Theory (ISIT'00), Sorrento, Italy, Jun. 25-30, 2000.
7. R. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ISTA, Ambleside, England, 2001.
8. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
9. S. Kim, J.-S. No, H. Chung, and D.-J. Shin, "Quasi-cyclic low-density parity-check codes with girth larger than 12," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2885-2891, Aug. 2007.
10. M. O'Sullivan, "Algebraic construction of sparse matrices with large girth," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 718-727, Feb. 2006.
11. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
12. I. E. Bocharova, B. D. Kudryashov, R. V. Satyukov, and S. Stiglmayr, "Short quasi-cyclic LDPC codes from convolutional codes," in Proc. IEEE International Symposium on Information Theory (ISIT'09), Seoul, South-Korea, Jun. 28-Jul. 3, 2009, pp. 551-555.
13. I. E. Bocharova, B. D. Kudryashov, and R. Satyukov, "Graph-based convolutional and block LDPC codes (in Russian)," Problems of Information Transmission, vol. 45, no. 4, pp. 69-90, 2009.
14. C. Berge, Graphs and Hypergraphs. Amsterdam: North Holland, 1976.
15. X.-Y. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE International Conference on Communications (ICC'04), vol. 2, Paris, France, Jun. 20-24, 2004, pp. 767-771.
16. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
17. J. L. Gross, "Voltage graphs," Discrete Mathematics, vol. 9, no. 3, pp. 239-246, 1974.
18. D. J. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems and Graphical Models. Springer-Verlag, 1999, pp. 113-130.