Information Theory - Csiszár, Imre

. .

Résumé :
Csisz?r and K?rner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It includes in-depth coverage of the mathematics of reliable information transmission, both in two-terminal and multi-terminal network scenarios. Updated and considerably expanded, this new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics. The presentations of all core subjects are self contained, even the advanced topics, which helps readers to understand the important connections between seemingly different problems. Finally, 320 end-of-chapter problems, together with helpful hints for solving them, allow readers to develop a full command of the mathematical techniques. It is an ideal resource for graduate students and researchers in electrical and electronic engineering, computer science and applied mathematics.

Biographie:
Imre Csisz?r is a Research Professor at the R?nyi Institute of the Hungarian Academy of Sciences, where he has worked since 1961. He is also Professor Emeritus of the University of Technology and Economics, Budapest, a Fellow of the Institute of Electronic and Electrical Engineers (IEEE) and former President of the Hungarian Mathematical Society. He has received numerous awards, including the Shannon Award of the IEEE Information Theory Society (1996).

Sommaire:
Part I. Information Measures in Simple Coding Problems: 1. Source coding and hypothesis testing: information measures; 2. Types and typical sequences; 3. Some formal properties of Shannon's information measures; 4. Non-block source coding; 5. Blowing up lemma: a combinatorial digression; Part II. Two-Terminal Systems: 6. The noisy channel problem; 7. Rate-distortion trade-off in source coding and the source-channel transmission problem; 8. Computation of channel capacity and ?-distortion rates; 9. A covering lemma: error exponent in source coding; 10. A packing lemma: on the error exponent in channel coding; 11. The compound channel revisited: zero-error information theory and extremal combinatorics; 12. Arbitrary varying channels; Part III. Multi-Terminal Systems: 13. Separate coding of correlated source; 14. Multiple-access channels; 15. Entropy and image size characteristics; 16. Source and channel networks; 17. Information-theoretic security.