| Source Coding | p. 1 |
| Source Coding: Fixed-Length Codes | p. 1 |
| Source Coding: Variable-Length Codes | p. 8 |
| Coding for General Sources: Fixed-Length Codes | p. 14 |
| Fixed-Length Coding for Mixed Sources | p. 20 |
| Strong Converse Theorem for Source Coding | p. 34 |
| e-Source Coding | p. 38 |
| Coding for General Sources: Variable-Length Codes | p. 43 |
| Coding for General Source: Weak Variable-Length Codes | p. 51 |
| Source Coding and Large Deviation: Decoding Error Probability | p. 63 |
| Source Coding and Large Deviation: Probability of Correct Decoding | p. 85 |
| Reliability Functions of the General Source with Variable-Length Coding | p. 96 |
| Information Spectrum and Invariancy | p. 97 |
| Random Number Generation | p. 103 |
| Random Number Generation | p. 103 |
| Resolvability and Intrinsic Randomness | p. 118 |
| Strong Converse Theorem for Random Number Generation | p. 124 |
| d-Random Number Generation | p. 128 |
| Variable-Length Intrinsic Randomness | p. 141 |
| Random Number Generation and Source Coding | p. 154 |
| Channel Coding | p. 169 |
| Channel Coding: Stationary Memoryless Channel | p. 169 |
| Coding for General Channel | p. 176 |
| Coding for Mixed Channels | p. 190 |
| e-Channel Coding | p. 210 |
| Strong Converse Theorem on Channel Coding | p. 218 |
| Channel Capacity with Cost Constraint | p. 225 |
| Strong Converse Property of Channel with Cost Constraint | p. 232 |
| Joint Source-Channel Coding | p. 247 |
| Separation Theorems of the Traditional Type | p. 263 |
| Hypothesis Testing | p. 269 |
| Hypothesis Testing | p. 269 |
| e-Hypothesis Testing | p. 279 |
| Strong Converse Theorem for Hypothesis Testing | p. 283 |
| Hypothesis Testing and Large Deviation Probability of Testing Error | p. 286 |
| Hypothesis Testing and Large Deviation: Probability of Correct Testing | p. 308 |
| Generalized Hypothesis Testing | p. 319 |
| Hypothesis Testing and Source Coding | p. 320 |
| Rate-Distortion Theory | p. 325 |
| Coding Subject to Distortion Criterion | p. 325 |
| Rate-Distortion Theory for Stationary Memoryless Sources | p. 325 |
| General Rate-Distortion Theory | p. 333 |
| Rate-Distortion Function Rfm(D X) | p. 340 |
| Rate-Distortion Function Rfa(D X) | p. 343 |
| Rate-Distortion Function Rvm(D X) | p. 348 |
| Rate-Distortion Function Rva(D X) | p. 357 |
| Rate-Distortion for Stationary Memoryless Sources Revisited | p. 369 |
| Rate-Distortion for Stationary Ergodic Sources | p. 376 |
| Rate-Distortion Function for Mixed Sources | p. 380 |
| Identification Code and Channel Resolvability | p. 395 |
| Identification Code and Channel Resolvability | p. 395 |
| Identification Coding | p. 396 |
| Channel Resolvability | p. 404 |
| Identification Capacity Theorem and Channel Resolvability Theorem | p. 413 |
| Identification Capacity with Cost Constraint | p. 421 |
| Channel Resolvability with Cost Constraint | p. 422 |
| Identification Capacity and Resolvability of Continuous Input Channels | p. 425 |
| Identification-Transmission Codes | p. 435 |
| Multi-Terminal Information Theory | p. 453 |
| What Is Multi-Terminal Information Theory? | p. 453 |
| The Slepian-Wolf Source Coding System | p. 454 |
| Slepian-Wolf Source Coding for Mixed Sources | p. 464 |
| e-Source Coding for Slepian-Wolf Source Coding System | p. 471 |
| Strong Converse Theorem for Slepian-Wolf Source Coding System | p. 477 |
| Multiple-Access Channel Coding Systems | p. 481 |
| General Capacity Region Theorem for Multiple-Access Channels | p. 483 |
| Stationary Memoryless Multiple-Access Channels | p. 487 |
| Mixed Multiple-Access Channels | p. 495 |
| Proof of Theorem 7.7.1 | p. 500 |
| e-Coding for Multiple-Access Channel | p. 509 |
| Strong Converse Theorem for Multiple-Access Channels | p. 513 |
| Multiple-Access Channels with Cost Constraint | p. 520 |
| References | p. 527 |
| Index | p. 533 |
| Table of Contents provided by Publisher. All Rights Reserved. |