02753aam a2200193 4500008004500000020001800045082001400063100001800077245007200095250001200167260004200179300001600221504097400237520125701211650001802468650002302486650003202509700001802541170509b2016 xxu||||| |||| 00| 0 eng d a9781107565043 a518bC8I6 aCsiszar, Imre aInformation theory: coding theorems for discrete memoryless systems a2nd ed. bCambridge university press c2016aUK axxi, 499 p. aTable of Contents:
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.
aCsiszá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.
http://www.cambridge.org/nu/academic/subjects/engineering/communications-and-signal-processing/information-theory-coding-theorems-discrete-memoryless-systems-2nd-edition?format=PB&isbn=9781107565043#ozwjOXPiVdHjt15E.97
aCoding theory aInformation theory aDiscrete memoryless systems aKorner, Jason