Book contents
- Frontmatter
- Contents
- Preface to the first edition
- Preface to the second edition
- Basic notation and conventions
- Introduction
- Part I Information measures in simple coding problems
- Part II Two-terminal systems
- 6 The noisy channel coding 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 and the error exponent in source coding
- 10 A packing lemma and the error exponent in channel coding
- 11 The compound channel revisited: zero-error information theory and extremal combinatorics
- 12 Arbitrarily varying channels
- Part III Multi-terminal systems
- References
- Name index
- Index of symbols and abbreviations
- Subject index
12 - Arbitrarily varying channels
Published online by Cambridge University Press: 05 August 2012
Book contents
- Frontmatter
- Contents
- Preface to the first edition
- Preface to the second edition
- Basic notation and conventions
- Introduction
- Part I Information measures in simple coding problems
- Part II Two-terminal systems
- 6 The noisy channel coding 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 and the error exponent in source coding
- 10 A packing lemma and the error exponent in channel coding
- 11 The compound channel revisited: zero-error information theory and extremal combinatorics
- 12 Arbitrarily varying channels
- Part III Multi-terminal systems
- References
- Name index
- Index of symbols and abbreviations
- Subject index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Information TheoryCoding Theorems for Discrete Memoryless Systems, pp. 209 - 240Publisher: Cambridge University PressPrint publication year: 2011