Information Theory: Coding Theorems for Discrete Memoryless SystemsHardback
List price $108.30
You save $8.86 (8%)
Free delivery worldwide
Dispatched in 1 business day
When will my order arrive?
- Publisher: CAMBRIDGE UNIVERSITY PRESS
- Format: Hardback | 522 pages
- Dimensions: 183mm x 254mm x 28mm | 1,120g
- Publication date: 15 August 2011
- Publication City/Country: Cambridge
- ISBN 10: 0521196817
- ISBN 13: 9780521196819
- Edition: 2, Revised
- Edition statement: 2nd Revised edition
- Illustrations note: 53 b/w illus. 347 exercises
- Sales rank: 576,286
Csiszar and Korner'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 solving hints, 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.
Other books in this category
USD$87.21 - Save $5.62 (6%) - RRP $92.83
USD$13.26 - Save $13.03 49% off - RRP $26.29
USD$15.91 - Save $3.08 16% off - RRP $18.99
USD$139.87 - Save $212.92 60% off - RRP $352.79
USD$24.73 - Save $10.09 28% off - RRP $34.82
Imre Csiszar is a Research Professor at the Renyi 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 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). Janos Korner 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 Mathematical Institute of the Hungarian Academy of Sciences for over twenty years, and he also worked at AT&T Bell Laboratories, Murray Hill, New Jersey, for two years.
'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 topic that has garnered very significant attention in the last few years. This book is an indispensable reference for researchers and graduate students working in the exciting and ever-growing area of information theory.' Giuseppe Caire, University of Southern California 'The classic treatise on the fundamental limits of discrete memoryless sources and channels - an indispensable tool for every information theorist.' Sergio Verdu, Princeton University 'The first edition of the Csiszar and Korner book on information theory is a classic, in constant use by most mathematically-oriented information theorists. The second edition expands the first with two new chapters, one on zero-error information theory and one on information theoretic security. These use the same consistent set of tools as [the first edition] to organize and prove the central results of these currently important areas. In addition, there are many new problems added to the original chapters, placing many newer research results into a consistent formulation.' Robert Gallager, Massachusetts Institute of Technology 'The field of applied mathematics known as Information Theory owes its origins and early development to three pioneers: Shannon (USA), Kolmogorov (Russia) and Renyi (Hungary). This book, authored by two of Renyi's leading disciples, represents the elegant and precise development of the subject by the Hungarian School. This second edition contains new research of the authors on applications to secrecy theory and zero-error capacity with connections to combinatorial mathematics.' Andrew Viterbi, University of Southern California
Table 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.