Publication subTitle :Coding Theorems for Discrete Memoryless Systems
Author: Imre Csiszár;János Körner;
Publisher: Cambridge University Press
Publication year: 2011
E-ISBN: 9781316921357
P-ISBN(Paperback): 9780521196819
P-ISBN(Hardback): 9780521196819
Subject: TP14 Automatic information theory
Keyword: 无线电电子学、电信技术
Language: ENG
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Description
Fully updated and revised edition of Csiszár and Körner's classic book on information theory. Written by two pioneering researchers, Information Theory provides in-depth coverage of the mathematics of communication, data processing, transmission and provable security. Updated and expanded, this new edition discusses information theoretic secrecy and zero-error information, and includes 320 end-of-chapter problems and hints for solving them. Written by two pioneering researchers, Information Theory provides in-depth coverage of the mathematics of communication, data processing, transmission and provable security. Updated and expanded, this new edition discusses information theoretic secrecy and zero-error information, and includes 320 end-of-chapter problems and hints for solving them. 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. 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. 'The classic treatise on the fundamental limits of discrete memoryless sources and channels – an indispensable tool for every information theorist.' Segio Verdú, Princeton University, New Jersey 'Information Theory: Coding Theorems for Discrete Memoryless Systems, by Imre Csiszar and Janos Korner, is a classic of modern information theory. 'Classic' since its first edition appeared in 1979. 'Modern' since the mathematical techniques and the results treated are still fundamentally up to date today. This new edition was long overdue. Beyond the original material, it contains two new chapters on zero-error information theory and connections to extremal combinatorics, and on information theoretic security, a top