nnel, can be used with error detection only stronger code C to decode the resulting word. or combined with error correcting codes. We conclude this chapter with suggestions for further reading. A rigorous treatment of source coding 3.4.6 Summary and further reading can be found in [6] and [17]. Excellent descriptions of modern channel codes are given in [43] and [33]. The The first part of this chapter presented the fundamental best reference for the latest advances in source and results of information theory, which culminate in channel coding is the IEEE Transactions on Information Shannon's joint source-channel coding theorem. While Theory. References [1] O. Acikel and W. Ryan. "Punctured [8] E. R. Berlekamp, R. J. McEliece, and [12] L. N. Childs. A Concrete Introduction turbo-codes for BPSK/QPSK H. C. A. van Tilborg. "On the to Higher Algebra, Springer, New channels," IEEE Trans. Commun., vol. intractability of certain coding York, 1995. 47, pp. 1315-1323, September 1999. problems," IEEE Trans. Inform. [13] J. Conway and N. Sloane. Sphere [2] V. K. Agarwal and A. Ivanov. Theory, vol. 24, pp. 384-386, May Packings and Error-Correcting Codes, "Computing the probability of 1978. Springer- Verlag, New York, 1988. undetected error for shortened cyclic [9] C. Berrou and A. Glavieux. "Near [14] S.-Y. Chung, G. D. Forney, T.J. codes," IEEE Trans. Commun., vol. optimum error correcting coding and Richardson, and R. Urbanke. "On the 40, pp. 494-499, March 1992. decoding: turbo-codes," IEEE Trans. design of low-density parity-check [3] R. B. Ash. Information Theory, Dover, Commun., vol. 44, pp. 1261-1271, codes within 0.0045 dB of the Shannon New York, 1965. October 1996. limit," IEEE Commun. Letters, vol. 5, [4] L. Bahl, J. Cocke, F. Jelinek, and [10] C. Berrou, A. Glavieux, and pp. 58-60, February 2001. J. Raviv. "Optimal decoding of linear P. Thitimajshima. "Near Shannon [15] T. M. Cover and J. A. Thomas. codes for minimizing symbol error limit error-correcting coding and Elements of Information Theory, rate," IEEE Tr