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
- 1 Source coding and hypothesis testing; information measures
- 2 Types and typical sequences
- 3 Formal properties of Shannon's information measures
- 4 Non-block source coding
- 5 Blowing up lemma: a combinatorial digression
- Part II Two-terminal systems
- Part III Multi-terminal systems
- References
- Name index
- Index of symbols and abbreviations
- Subject index
2 - Types and typical sequences
Published online by Cambridge University Press: 05 August 2012
- 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
- 1 Source coding and hypothesis testing; information measures
- 2 Types and typical sequences
- 3 Formal properties of Shannon's information measures
- 4 Non-block source coding
- 5 Blowing up lemma: a combinatorial digression
- Part II Two-terminal systems
- Part III Multi-terminal systems
- References
- Name index
- Index of symbols and abbreviations
- Subject index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511921889/resource/name/firstPage-9780511921889c2_p16-33_CBO.jpg)
- Type
- Chapter
- Information
- Information TheoryCoding Theorems for Discrete Memoryless Systems, pp. 16 - 33Publisher: Cambridge University PressPrint publication year: 2011