Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010118507 | Q360 C74 2011 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
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.
Author Notes
Imre Csisz is a Research Professor at the Alfrd Rnyi Institute of Mathematics 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 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).
Jnos Krner is a Professor of Computer Science at the Sapienza University of Rome, Italy, where he has worked since 1992. Prior to this, he was a member of the Institute of Mathematics of the Hungarian Academy of Sciences for over 20 years, and he also worked at ATT Bell Laboratories, Murray Hill, New Jersey, for two years.
Table of Contents
| Preface to the first edition | p. ix |
| Preface to the second edition | p. xi |
| Basic notation and conventions | p. xii |
| Introduction | p. xv |
| Part I Information measures in simple coding problems | p. 1 |
| 1 Source coding and hypothesis testing; information measures | p. 3 |
| 2 Types and typical sequences | p. 16 |
| 3 Formal properties of Shannon's information measures | p. 34 |
| 4 Non-block source coding | p. 48 |
| 5 Blowing up lemma: a combinatorial digression | p. 71 |
| Part II Two-terminal systems | p. 81 |
| 6 The noisy channel coding problem | p. 83 |
| 7 Rate-distortion trade-off in source coding and the source-channel transmission problem | p. 107 |
| 8 Computation of channel capacity and $$$-distortion rates | p. 120 |
| 9 A covering lemma and the error exponent in source coding | p. 132 |
| 10 A packing lemma and the error exponent in channel coding | p. 144 |
| 11 The compound channel revisited: zero-error information theory and extremal combinatorics | p. 184 |
| 12 Arbitrarily varying channels | p. 209 |
| Part III Multi-terminal systems | p. 241 |
| 13 Separate coding of correlated sources | p. 243 |
| 14 Multiple-access channels | p. 272 |
| 15 Entropy and image size characterization | p. 304 |
| 16 Source and channel networks | p. 354 |
| 17 Information-theoretic security | p. 400 |
| References | p. 461 |
| Name index | p. 478 |
| Index of symbols and abbreviations | p. 482 |
| Subject index | p. 485 |
