Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 265-280

  Halabi, Nissim ^a   Even, Guy ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Linear programming based decoding; Repeat accumulate codes; Turbo codes; Word error rate

Indexed keywords

ALGORITHMS; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; GRAPH THEORY; HAMILTONIANS; LINEAR PROGRAMMING; POLYNOMIALS; PROBABILITY; THEOREM PROVING; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; LINEAR PROGRAMMING BASED DECODING; REPEAT ACCUMULATE CODES; WORD ERROR RATE;

TURBO CODES;

EID: 12444264912     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.839509     Document Type: Article

References (15)

1. C. Berrou, A. Glavieux, and P. Thitimajashima, "Near Shannon limit error-correction coding: Turbo codes," in Proc. IEEE Int. Conf. Communications (ICC), Geneva. Switzerland, May 1993, pp. 1064-1070.
2. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 36th Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 1998, pp. 201-210.
3. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the intractability of certain coding problems," IEEE Trans. Inf. Theory vol. IT-24, no. 3, pp. 384-386, May 1978.
4. J. Feldman and D. R. Karger, "Decoding turbo-like codes via linear programming," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), Nov. 2002.
5. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
6. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
7. J. Feldman, D. R. Karger, and M. J. Wainwright, "Linear programming-based decoding of turbo-like codes and its relation to iterative approaches," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing. Monticello, IL, Oct. 2002.
8. J. Feldman, private communication, 2003.
9. P. Erdös and H. Sachs, "Reguläre graphen gegebene taillenweite mit minimaler knotenzahl," Wiss. Z. Univ. Hall Martin Luther Univ. Halle-Wittenberg Math. Natur Reine, vol. 12, pp. 251-257, 1963.
10. N. Sauer, "Extremaleigenschaften regulärer Graphen gegebener Taillenweite, I & II," Sitzungsberichte Österreich. Acad. Wiss. Math. Natur. Kl., vol. S-B II, no. 176, pp. 9-25, 1967.
11. N. Biggs, "Constructions for cubic graphs with large girth," Electron. J. Comb., vol. 5, no. A1, 1998.
12. L. Bazzi, M. Mahdian, S. Miller. and D. Spielman, "The minimum distance of turbo-like codes," unpublished manuscript, 2001.
13. W. Feller, An Introduction to Probability Theory and its Applications 3rd ed. New York: Wiley, 1968, vol. I.
14. S. Jukna, Extremal Combinatorics : With Applications in Computer Science. Berlin, Germany: Springer-Verlag, 2001.
15. N. Halabi. (2003) Algorithms. Implementation and Experimental Results - Bounds on the Word Error Probability of RA(2) Codes with Linear Programming Based Decoding. [Online]. Available: http:// www.eng.tau.ac.il/~nissimh/RA2/