Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.
Save up to 30% on print and eBooks.
Information Theory
Coding Theorems for Discrete Memoryless Systems
1st Edition - January 28, 1982
Authors: Imre Csiszár, János Körner
Editors: Z. W. Birnbaun, E. Lukacs
Language: English
eBook ISBN:9781483281575
9 7 8 - 1 - 4 8 3 2 - 8 1 5 7 - 5
Information Theory: Coding Theorems for Discrete Memoryless Systems presents mathematical models that involve independent random variables with finite range. This three-chapter…Read more
Purchase options
LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code is needed.
Information Theory: Coding Theorems for Discrete Memoryless Systems presents mathematical models that involve independent random variables with finite range. This three-chapter text specifically describes the characteristic phenomena of information theory. Chapter 1 deals with information measures in simple coding problems, with emphasis on some formal properties of Shannon’s information and the non-block source coding. Chapter 2 describes the properties and practical aspects of the two-terminal systems. This chapter also examines the noisy channel coding problem, the computation of channel capacity, and the arbitrarily varying channels. Chapter 3 looks into the theory and practicality of multi-terminal systems. This book is intended primarily for graduate students and research workers in mathematics, electrical engineering, and computer science.
IntroductionBasic Notations and Conventions1. 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 Digression2. Two-Terminal Systems § 1. The Noisy Channel Coding Problem § 2. Rate-Distortion Trade-Off in Source Coding and the Source-Channel Transmission Problem § 3. Computation of Channel Capacity and Δ-Distortion Rates §4. A Covering Lemma. Error Exponent in Source Coding §5. A Packing Lemma. On the Error Exponent in Channel Coding § 6. Arbitrarily Varying Channels3. Multi-Terminal Systems § 1. Separate Coding of Correlated Source § 2. Multiple-Access Channels § 3. Entropy and Image Size Characterization § 4. Source and Channel NetworksReferencesName IndexSubject IndexIndex of Symbols and Abbreviations