Braided convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Zhang, Wei ^a   Lentmaier, Michael ^a,b,c   Costello, Daniel J ^a   Zigangirov, Kamil Sh ^a  

^a University of Notre Dame   (United States)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTION; ITERATIVE DECODING;

BRAIDED CODES; CONSTRAINT LENGTHS; CONVERGENCE BEHAVIORS; FREE DISTANCE;

CONVOLUTIONAL CODES;

EID: 85114343523     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523404     Document Type: Conference Paper

References (16)

1. M. Lentmaier, D. V. Truhachev, and K. S. Zigangirov, “Iterative decodable sliding codes on graphs,” in Proceedings of ACCT-VIII, St-Petersburg, Russia, Sept. 2002, pp. 190-193.
2. D. V. Truhachev, M. Lentmaier, and K. S. Zigangirov, “On braided block codes,” in Proceedings of the IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003, p. 32.
3. P. Elias, “Error free coding,” IRE Transactions on Information Theory, vol. 4, no. 4, pp. 29-37, 1954.
4. M. Sipser and D. A. Spielman, “Expander codes,” IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
5. R. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
6. K. Engdahl, M. Lentmaier, and K. S. Zigangirov, “On the theory of low-density convolutional codes,” in Proceedings of Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Hawaii, June 1999, pp. 77-86.
7. R. Johannesson and K. S. Zigangirov, Fundamentals of convolutional coding. IEEE Press, 1999.
8. W. Zhang, M. Lentmaier, D. J. Costello Jr., and K. S. Zigangirov, “Analysis and design of braided convolutional codes,” to be submitted to IEEE Trans. Inform. Theory, June 2005.
9. A. J. Feltström and K. S. Zigangirov, “Periodic time-varying convolutional codes with low-density parity-check matrices,” IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 2181-2190, Sept. 1999.
10. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. 20, no. 2, pp. 284-287, Mar. 1974.
11. M. Lentmaier, D. V. Truhachev, K. S. Zigangirov, and D. J. Costello Jr., “An analysis of the block error probability performance of iterative decoding,” submitted to IEEE Trans. on Inform. Theory, Apr. 2004.
12. C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,” IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
13. K. Engdahl, M. Lentmaier, D. V. Truhachev, and K. S. Zigangirov, “Analytical approach to low-density convolutional codes,” in Proceedings of the IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000, p. 201.
14. M. Lentmaier, “Towards a theory of codes for iterative decoding,” Ph.D. dissertation, Lund University, Sweden, Mar. 2003.
15. K. Engdahl, “Analysis of some convolutional coding constructions,” Ph.D. dissertation, Lund University, Sweden, May 2002.
16. D. J. Costello Jr., “Free distance bounds for convolutional codes,” IEEE Trans. Inform. Theory, vol. 20, no. 3, pp. 356-365, May 1974.