A method for convergence analysis of iterative probabilistic decoding

IEEE Transactions on Information Theory

Volumn 46, Issue 6, 2000, Pages 2206-2211

  Mihaljevic, Miodrag J ^a   Golic, Jovan D ^b,c  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^c School of Electrical Engineering   (Serbia)

Author keywords

Convergence condition; Iterative error correction decoding; Linear block codes

Indexed keywords

ALGORITHMS; BINARY CODES; BIT ERROR RATE; CONVERGENCE OF NUMERICAL METHODS; DECODING; ERROR ANALYSIS; ERROR CORRECTION; ITERATIVE METHODS; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING;

BINARY LINEAR BLOCK CODES; SOFT DECODING; TURBO CODES;

BLOCK CODES;

EID: 0034269942     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.868493     Document Type: Article

References (17)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo codes, in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, 1993, pp. 1064-1070.
2. M. Bossert and F. Hergert, Hard- and soft-decision decoding beyond the half minimum distance-An algorithm for linear codes, IEEE Trans. Inform. Theory, vol. IT-32, pp. 709-714, Sept. 1986.
3. A. Clark, J. Dj. Golic, and E. Dawson, A comparison of fast correlation attacks, in Fast Software Encryption-Cambridge'96, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1996, vol. 1039, pp. 145-157.
4. G. C. Clark Jr. and J. B. Cain, Error-Correcting Coding for Digital Communications. New York: Plenum, 1982.
5. R. G. Gallager, Low-density parity-check codes, IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
6. J. Dj. Golic, Computation of low-weight parity-check polynomials, Electron. Lett., vol. 32, no. 21, pp. 1981-1982, Oct. 1996.
7. C. R. P. Hartmann and L. D. Rudolph, An optimum symbol-by-symbol decoding rule for linear codes, IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
8. J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes, IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
9. T. Koumoto, T. Takata, T. Kasami, and S. Lin, An iterative soft-decision decoding algorithm, in Proc. 1996 IEEE Int. Symp. Information Theory and Its Applications, Victoria, B.C., Canada, 1996, pp. 806-810.
10. R. Lucas, M. Bossert, and M. Breitbach, Iterative soft decision decoding of linear binary block codes, in Proc. 1996 IEEE Int. Symp. Information Theory and Its Applications, Victoria, B.C., Canada, 1996, pp. 811-814.
11. J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
12. W. Meier and O. Staffelbach, Fast correlation attacks on certain stream ciphers,J. Cryptol, vol. 1, pp. 159-176, 1989.
13. M. J. Mihaljevic and J. Dj. Golic, A comparison of cryptanalytic principles based on iterative error-correction, in Advances in Cryptology-EUROCRYPT'91, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1991, vol. 547, pp. 527-531.
14. _, A method for convergence analysis of iterative error-correction decoding, in Proc. 1996 IEEE Int. Symp. Information Theory and Its Applications, Victoria, B.C., Canada, 1996, pp. 802-805.
15. W. W. Peterson and E. J. Weldon, Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.
16. K. Zeng and M. Huang, On the linear syndrome method in cryptanalysis, in Advances in Cryptology-CRYPTO'88, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1990, vol. 403, pp. 469-478.
17. M. Zivkovic, On two probabilistic decoding algorithms for binary linear codes, IEEE Trans. Inform. Theory, vol. 37, pp. 1707-1716, Nov. 1991.