Why we can not surpass capacity: The matching condition

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 1, Issue , 2005, Pages 10-19

  Méasson, Cyril ^a   Montanari, Andrea ^b   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. A. Shokrollahi, "Capacity-achieving sequences", in Codes, Systems, and Graphical Models (B. Marcus and J. Rosenthal, eds.), vol. 123 of IMA Volumes in Mathematics and its Applications, pp. 153-166, Springer-Verlag, 2000.
2. P. Oswald and A. Shokrollahi, "Capacity achieving sequences for the erasure channel", in Proceedings of the International Symposium on Information Theory, Wash- ington DC, p. 48, 2001.
3. S. ten Brink, "Convergence of iterative decoding", Electron. Lett., vol. 35, pp. 806-808, May 1999.
4. S. ten Brink, "Iterative decoding for multicode CDMA", in Proc. IEEE VTC, vol. 3, pp. 1876-1880, May 1999.
5. S. ten Brink, "Iterative decoding trajectories of parallel concatenated codes", in Proc. 3rd IEEE/ITG Conf. Source Channel Coding, pp. 75-80, Jan. 2000.
6. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Inform. Theory, vol. 49, pp. 1727-1737, Oct. 2001.
7. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: a model and two properties", in Proc. of Conference on Information Sciences and Systems (CISS), (Princeton University), Mar. 2002.
8. A. Ashikhmin, G. Kramer, and S. ten Brink, "Code rate and the area under extrinsic information transfer curves", in Proc. of the IEEE Int. Symposium on Inform. Theory, (Lausanne, Switzerland), p. 115, June 30-July 5 2002.
9. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: model and erasure channel property", IEEE Trans. Inform. Theory, vol. 50, pp. 2657-2673, Nov. 2004.
10. S. Huettinger, J. Huber, R. Johannesson, and R. Fischer, "Information processing in Soft-Ouput decoding", in Proc. of the Allerton Conf. on Commun., Control and Computing, (Monticello, IL, USA), Oct. 2001.
11. S. Huettinger and J. Huber, "Extrinsic and intrinsic information in systematic coding", in Proc. of the IEEE Int. Symposium on Inform. Theory, (Lausanne, Switzerland), June 30-July 5 2002.
12. C. Méasson and R. Urbanke, "Asymptotic analysis of turbo codes over the binary erasure channel", in Proc. of the 12th Joint Conference on Communications and Coding, (Saas Fee, Switzerland), March 2002.
13. C. Méasson and R. Urbanke, "Further analytic properties of EXIT-like curves and applications", in Proc. of the IEEE Int. Symposium on Inform. Theory, (Yokohama, Japan), p. 266, June 29-July 4 2003.
14. K. Bhattad and K. R. Narayanan, "An MSE based transfer chart to analyze iterative decoding schemes", in Proc. of the Allerton Conf. on Commun., Control and Computing, (Monticello, IL, USA), Oct. 2004.
15. D. Guo, S. Shamai, and S. Verdú, "Mutual information and MMSE in gaussian channels", in IEEE International Symposium on Information Theory, (Chicago, USA), p. 349, June 27 - July 2 2004.
16. D. Guo, S. Shamai, and S. Verdu, "Mutual information and minimum mean-square error in gaussian channels", IEEE Trans. Inform. Theory, vol. 51, pp. 1261-1882, Apr. 2005.
17. C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, "Life above threshold: From list decoding to area theorem and MSE", in Proc. of the IEEE Inform. Theory Workshop, (San Antonio, Texas), October 24-29 2004.
18. G. D. Forney, "Lecture notes." MIT, 2005.
19. C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, "Maximum a posteriori decoding and turbo codes for general memoryless channels", in Proc. of the IEEE Int. Symposium on Inform. Theory, (Adelaide), 2005.