Decoding turbo-like codes via linear programming

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 251-260

  Feldman, Jon ^a   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; ERRORS; GRAPH THEORY; PROBABILITY; THEOREM PROVING; TURBO CODES;

INVERSE POLYNOMIAL; REPEAT-ACCUMULATE CODES; TURBO-LIKE CODES;

LINEAR PROGRAMMING;

EID: 0036953755     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Prentice-Hall, 1993.
2. L. Bazzi, M. Mahdian, S. Miller, and D. Spielman. The minimum distance of turbo-like codes. manuscript, 2001.
3. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: turbo-codes. Proc. IEEE International Conference on Communication (ICC), Geneva, Switzerland, pages 1064-1070, May 1993.
4. N. Biggs. Constructions for cubic graphs with large girth. Electronic Journal of Combinatorics, 5(A1), 1998.
5. M. Breiling and J. Huber. Upper bound on the minimum distance of turbo codes using a combinatorial approach, 2001.
6. D. Divsalar, H. Jin, and R. McEliece. Coding theorems for 'turbo-like' codes. Proc. 36th Annual Allerton Conference on Comm., Control, and Computing, pages 201-210, Sept 1998.
7. P. Erdös and H. Sachs. Regulare graphen gegebene taillenweite mit minimaler knotenzahl. Wiss. Z. Univ. Hall Martin Luther Univ. Halle-Wittenberg Math.-Natur. Reine, 12:251-257, 1963.
8. J. Feldman, D. Karger, and M. Wainwright. Linear programming based decoding of turbo-like codes and its relation to iterative approaches. Proc. 40th Annual Allerton Conference on Comm., Control, and Computing, October 2002.
9. G. Forney. Convolutional codes II: Maximum likelihood decoding. Inform. Control, 25:222-266, 1974.
10. N. Kahale and R. Urbanke. On the minimum distance of parallel and serially concatenated codes. IEEE International Symposium on Information Theory, 1998.
11. F. MacWilliams and N. Sloane. The Theory of Error Correcting Codes. North-Holland, 1981.
12. R. McEliece, D. MacKay, and J. Cheng. Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE Journal on Selected Areas in Communications, 16(2):140-152, 1998.
13. T. Richardson, M. A. Shokrollahi, and R. L. Urbanke. Design of capacity-approaching irregular low-density parity-check codes. Information Theory, IEEE Transactions on, 47(2):619-637, 2001.
14. T. Richardson and R. Urbanke. The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 47(2), February 2001.
15. N. Sauer. Extremaleigenschaften regularer graphen gegebener taillenweite, iandii. Sitzungsberichte Osterreich. Acad. Wiss. Math. Natur. Kl., S-BII(176):27-43, 1967.
16. A. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory, IT-13:260-269, Apr. 1967.
17. B. Vucetic and J. Yuan. Turbo Codes. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
18. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches. MID LIDS Tech. report, July 2002.
19. S. Wicker. Error Control Systems for Digital Communication and Storage. Prentice-Hall, Englewood Cliffs, NJ, 1995.