ShopSpell

Information Theory Coding Theorems for Discrete Memoryless Systems [Hardcover]

$220.99       (Free Shipping)
100 available
  • Category: Books (Computers)
  • Author:  Csisz}}r, Imre, K}}rner, J}}nos
  • Author:  Csisz}}r, Imre, K}}rner, J}}nos
  • ISBN-10:  0521196817
  • ISBN-10:  0521196817
  • ISBN-13:  9780521196819
  • ISBN-13:  9780521196819
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  522
  • Pages:  522
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2011
  • Pub Date:  01-May-2011
  • SKU:  0521196817-11-MPOD
  • SKU:  0521196817-11-MPOD
  • Item ID: 100211615
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 01 to Jul 03
  • Notes: Brand New Book. Order Now.
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 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.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 ilóâ
Add Review