Extremal problems of information combining

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1236-1240

  Jiang, Yibo ^a   Ashikhmin, Alexei ^b   Koetter, Ralf ^a   Singer, Andrew C ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY-INPUT SYMMETRIC-OUTPUT CHANNELS; INFORMATION COMBINING PROBLEM; SOFT-BITS;

CONSTRAINT THEORY; PROBLEM SOLVING;

INFORMATION THEORY;

EID: 33749426230     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523539     Document Type: Conference Paper

References (16)

1. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
2. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
3. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
4. S. Huettinger, J. Huber, R. Johannesson, and R. Fischer, "Information processing in soft-output decoding," in Proc. Allerton Conf. on Communications, Control, and Computing, Monticello, IL, Oct. 2001.
5. S. Huettinger, J. Huber, R. Fischer, and R. Johannesson, "Soft-output-decoding: Some aspects from information theory," in Proc. Int. ITG Conf. on Source and Channel Coding, Berlin, Germany, Jan. 2002, pp. 81-90.
6. I. Land, S. Huettinger, P. A. Hoeher, and J. Huber, "Bounds on information combining," in Proc. Int. Symp. on Turbo Codes & Rel. Topics, Brest, France, Sept. 2003, pp. 39-42.
7. _, "Bounds on information combining," IEEE Trans. Inform. Theory, vol. 51, no. 2, pp. 612-619, Feb. 2005.
8. I. Land, P. A. Hoeher, and J. Huber, "Bounds on information combining for parity-check equations," in Proc. Int. Zurich Seminar on Communications (IZS), Zurich, Switzerland, Feb. 2004, pp. 68-71.
9. I. Land, S. Huettinger, P. A. Hoeher, and J. Huber, "Bounds on mutual information for simple codes using information combining," Annals of Telecomm., Jan. 2005, accepted for publication.
10. I. Sutskover, S. Shamai, and J. Ziv, "Extremes of information combining," in Proceedings of the 41st Annual Allerton Conference on Communications, Conrol and Computing, Monticello, IL, Oct. 2003, pp. 1446-1455.
11. _, "Extremes of information combining," IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1313-1326, Apr. 2005.
12. E. Sharon, A. Ashikhmin, and S. Litsyn, "EXIT functions for the Gaussian channel," in Proceedings of 41st Annual Allerton Conference on Communication, Control and Computing, Monticello, Illinois, Oct. 2003, pp. 972-981.
13. _, "EXIT functions for continuous channels: Part I. Constituent codes," IEEE Trans. Commun., submitted for publication, 2004.
14. M. G. Krein and A. A. Nudel'man, The Markov Moment Problem and Extremal Problems. Providence, Rhode Island: American Mathematical Society, 1977.
15. S. Karlin and W. J. Studden, Tchebycheff Systems: with Applications in Analysis and Statistics. New York: Interscience Publishers, 1966.
16. Y. Jiang, A. Ashikhmin, R. Koetter, and A. C. Singer, "Extremal problems of information combining," 2005, in preparation.