Short quasi-cyclic LDPC codes from convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 551-555

  Bocharova, Irina E ^a   Kudryashov, Boris D ^a   Satyukov, Roman V ^a   Stiglmayr, Stephan ^b  

^a ITMO UNIVERSITY   (Russian Federation)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; FINITE GEOMETRY; FREE DISTANCE; LDPC CODES; MINIMUM DISTANCE; QC LDPC CODES; QUASI-CYCLIC; QUASI-CYCLIC LDPC CODES; SHORT LDPC CODES; TAIL-BITING;

COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTION; GRAPH THEORY; QUANTUM THEORY; TERBIUM ALLOYS; TURBO CODES;

CONVOLUTIONAL CODES;

EID: 70449475981     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205685     Document Type: Conference Paper

References (18)

1. R. G. Gallager, Low-density Parity-Check Codes, Cambridge, MA: MIT Press, 1963.
2. T. J. Richardson, M. A. Shokrollani, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol.47, pp.619-637, Feb. 200l.
3. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol.51, no. 1, pp.386-398, Jan. 2005.
4. R. M. Tanner, D. Sridhara, and T. E. Fuja, " A class of group-structured LDPC codes," in Proc. ISTA, Ambleside, England, 2001
5. M. P. C. Fossorier, "Quasi-cyclic low-density partity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol.50, no.8, pp.1788-1793, Dec. 2004.
6. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. 1. Costello,Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol.50, no.12, pp.2966-2984, Dec. 2004.
7. J. Thorpe, "Low-density parity-check (LDPC) codes for fast encoding," IPN Progr. Rep. 42-154, JPL., Aug., 2003.
8. J. Bocharova, B. Kudryashov, R. Johannesson, V. Zyablov, "Asymptotically good woven codes with fixed constituent convolutional codes," Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France, June 24-29, 2007, pp.2326-2330.
9. R. M. Tanner, "A Recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vo1.27, no.5, pp.533-547, Sep. 1981
10. D. J. C. MacKay and M. Davey, "Evaluation of Gallager codes for short block length and high rate application," in Proc. IMA Workshop Codes, Systems and Graphical Models, 1999.
11. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, Piscataway, NJ, 1999.
12. J. E. Bocharova, M. Handlery, R. Johannesson, and B.D. Kudryashov, "Tailbiting codes obtained via convolutional codes with large slope", IEEE Trans. Inf. Theory. Sept., 2002. Vol. 48, pp.2577-2587.
13. I. E. Bocharova, M. Handlery, R. Johannesson, and B.D. Kudryashov, "A BEAST for prowling in trees," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1295-1302, June 2004.
14. A. V. Aho, 1. E. Hopcroft, and 1. D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983
15. M. Hall, Combinatorial theory, Blaisdell Publishing Company, 1967.
16. N. J. A. Sloane, (2008), The On-Line Encyclopedia of Integer Sequences, www.research.att.com/njas/sequences/A004136.
17. G. Malema and M. Liebelt, "Quasi-cyclic LDPC codes ofcolumn-weight two using a search algprithm," EURASIP Journal on Advances in Signal Processing. V. 2007, Article ID 45768.
18. T. R. Halford and K. M. Chugg, "An algorithm for counting short cycles in bipartite graphs," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 287-292, Jan., 2006.