Information theory : coding theorems for discrete memoryless systems
By: Csiszár, Imre
Title By: Korner, Janos
Material type:
BookPublisher: Cambridge : Cambridge University Press, c2011.Edition: 2nd ed.Description: xxi, 499 p. : ill. ; 26 cm.ISBN: 9781107565043; 0521196817Subject(s): Coding theory -- TextbooksDDC classification: 518 CS IN Online resources: Location Map | Item type | Home library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| REGULAR | University of Wollongong in Dubai Main Collection | 518 CS IN (Browse shelf) | Available | T0055077 |
, Shelving location: Main Collection Close shelf browser
|
|
|
|
|
|
|
||
| 516.24 MC TR Trigonometry / | 516.24071 TA TR Trigonometry : | 516.36 VA DI Differential geometry for physicists and mathematicians : | 518 CS IN Information theory : | 518 GR NU Numerical methods : | 518 SA NU Numerical analysis | 518.02462 CH NU Numerical methods for engineers |
Includes bibliographical references (p. [461]-477) and indexes.
Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results.
2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion.
ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14).
Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems.
Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools.
Fully updated and revised edition of Csiszár and Körner's classic book on information theory.