Elements of Information Theory, 2/e (Hardcover)
Thomas M. Cover, Joy A. Thomas
- 出版商: Wiley
- 出版日期: 2006-06-01
- 售價: $2,280
- 貴賓價: 9.8 折 $2,234
- 語言: 英文
- 頁數: 776
- 裝訂: Hardcover
- ISBN: 0471241954
- ISBN-13: 9780471241959
-
相關分類:
物理學 Physics、機率統計學 Probability-and-statistics
-
相關翻譯:
信息論基礎 (Elements of Information Theory, 2/e) (簡中版)
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
CCNA Self-Study: Interconnecting Cisco Network Devices (ICND) 640-811, 640-801, 2/e$2,350$2,233 -
$1,176Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041) -
計算機組織與設計 (Computer Organization and Design: The Hardware/Software Interface, 3/e)$680$646 -
AutoCAD 2006 實力養成暨評量$350$277 -
深入淺出設計模式 (Head First Design Patterns)$880$695 -
深入淺出 Java 程式設計, 2/e (Head First Java, 2/e)$880$581 -
作業系統原理 (Silberschatz: Operating System Principles, 7/e)$780$741 -
$2,660Thinking in Java, 4/e (Paperback) -
鳥哥的 Linux 私房菜基礎學習篇, 2/e$780$702 -
ASP.NET 2.0 深度剖析範例集$650$507 -
SQL 語法範例辭典$550$468 -
Linux 驅動程式, 3/e (Linux Device Drivers, 3/e)$980$774 -
$1,080CMMI: Guidelines for Process Integration and Product Improvement, 2/e -
Linux 核心詳解, 3/e (Understanding the Linux Kernel, 3/e)$1,200$948 -
OpenOffice.org 成功導入寶典$400$340 -
深入淺出物件導向分析與設計 (Head First Object-Oriented Analysis and Design)$880$616 -
C++ Primer, 4/e (中文版)$990$891 -
現代嵌入式系統開發專案實務－菜鳥成長日誌與專案經理的私房菜$600$480 -
資訊架構學網站應用 (Information Architecture for the World Wide Web, 3/e)$720$569 -
大話設計模式$620$527 -
$1,550Optimal Control, 3/e (Hardcover) -
無瑕的程式碼－敏捷軟體開發技巧守則 (Clean Code: A Handbook of Agile Software Craftsmanship)$580$452 -
Predictive Control for Linear and Hybrid Systems (Paperback)$3,040$2,888 -
統計之美：人工智慧時代的科學思維$580$458 -
機器學習的數學基礎 : AI、深度學習打底必讀$580$493
相關主題
商品描述
Description
The latest edition of this classic is updated with new problem sets and material
The Second Edition of this fundamental textbook maintains the book's tradition of clear, thought-provoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory.
All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing. The authors provide readers with a solid understanding of the underlying theory and applications. Problem sets and a telegraphic summary at the end of each chapter further assist readers. The historical notes that follow each chapter recap the main points.
The Second Edition features:
* Chapters reorganized to improve teaching
* 200 new problems
* New material on source coding, portfolio theory, and feedback capacity
* Updated references
Now current and enhanced, the Second Edition of Elements of Information Theory remains the ideal textbook for upper-level undergraduate and graduate courses in electrical engineering, statistics, and telecommunications.
Table of Contents
Preface to the Second Edition.
Preface to the First Edition.
Acknowledgments for the Second Edition.
Acknowledgments for the First Edition.
1. Introduction and Preview.
1.1 Preview of the Book.
2. Entropy, Relative Entropy, and Mutual Information.
2.1 Entropy.
2.2 Joint Entropy and Conditional Entropy.
2.3 Relative Entropy and Mutual Information.
2.4 Relationship Between Entropy and Mutual Information.
2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information.
2.6 Jensen’s Inequality and Its Consequences.
2.7 Log Sum Inequality and Its Applications.
2.8 Data-Processing Inequality.
2.9 Sufficient Statistics.
2.10 Fano’s Inequality.
Summary.
Problems.
Historical Notes.
3. Asymptotic Equipartition Property.
3.1 Asymptotic Equipartition Property Theorem.
3.2 Consequences of the AEP: Data Compression.
3.3 High-Probability Sets and the Typical Set.
Summary.
Problems.
Historical Notes.
4. Entropy Rates of a Stochastic Process.
4.1 Markov Chains.
4.2 Entropy Rate.
4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph.
4.4 Second Law of Thermodynamics.
4.5 Functions of Markov Chains.
Summary.
Problems.
Historical Notes.
5. Data Compression.
5.1 Examples of Codes.
5.2 Kraft Inequality.
5.3 Optimal Codes.
5.4 Bounds on the Optimal Code Length.
5.5 Kraft Inequality for Uniquely Decodable Codes.
5.6 Huffman Codes.
5.7 Some Comments on Huffman Codes.
5.8 Optimality of Huffman Codes.
5.9 Shannon–Fano–Elias Coding.
5.10 Competitive Optimality of the Shannon Code.
5.11 Generation of Discrete Distributions from Fair Coins.
Summary.
Problems.
Historical Notes.
6. Gambling and Data Compression.
6.1 The Horse Race.
6.2 Gambling and Side Information.
6.3 Dependent Horse Races and Entropy Rate.
6.4 The Entropy of English.
6.5 Data Compression and Gambling.
6.6 Gambling Estimate of the Entropy of English.
Summary.
Problems.
Historical Notes.
7. Channel Capacity.
7.1 Examples of Channel Capacity.
7.2 Symmetric Channels.
7.3 Properties of Channel Capacity.
7.4 Preview of the Channel Coding Theorem.
7.5 Definitions.
7.6 Jointly Typical Sequences.
7.7 Channel Coding Theorem.
7.8 Zero-Error Codes.
7.9 Fano’s Inequality and the Converse to the Coding Theorem.
7.10 Equality in the Converse to the Channel Coding Theorem.
7.11 Hamming Codes.
7.12 Feedback Capacity.
7.13 Source–Channel Separation Theorem.
Summary.
Problems.
Historical Notes.
8. Differential Entropy.
8.1 Definitions.
8.2 AEP for Continuous Random Variables.
8.3 Relation of Differential Entropy to Discrete Entropy.
8.4 Joint and Conditional Differential Entropy.
8.5 Relative Entropy and Mutual Information.
8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information.
Summary.
Problems.
Historical Notes.
9. Gaussian Channel.
9.1 Gaussian Channel: Definitions.
9.2 Converse to the Coding Theorem for Gaussian Channels.
9.3 Bandlimited Channels.
9.4 Parallel Gaussian Channels.
9.5 Channels with Colored Gaussian Noise.
9.6 Gaussian Channels with Feedback.
Summary.
Problems.
Historical Notes.
10. Rate Distortion Theory.
10.1 Quantization.
10.2 Definitions.
10.3 Calculation of the Rate Distortion Function.
10.4 Converse to the Rate Distortion Theorem.
10.5 Achievability of the Rate Distortion Function.
10.6 Strongly Typical Sequences and Rate Distortion.
10.7 Characterization of the Rate Distortion Function.
10.8 Computation of Channel Capacity and the Rate Distortion Function.
Summary.
Problems.
Historical Notes.
11. Information Theory and Statistics.
11.1 Method of Types.
11.2 Law of Large Numbers.
11.3 Universal Source Coding.
11.4 Large Deviation Theory.
11.5 Examples of Sanov’s Theorem.
11.6 Conditional Limit Theorem.
11.7 Hypothesis Testing.
11.8 Chernoff–Stein Lemma.
11.9 Chernoff Information.
11.10 Fisher Information and the Cram´er–Rao Inequality.
Summary.
Problems.
Historical Notes.
12. Maximum Entropy.
12.1 Maximum Entropy Distributions.
12.2 Examples.
12.3 Anomalous Maximum Entropy Problem.
12.4 Spectrum Estimation.
12.5 Entropy Rates of a Gaussian Process.
12.6 Burg’s Maximum Entropy Theorem.
Summary.
Problems.
Historical Notes.
13. Universal Source Coding.
13.1 Universal Codes and Channel Capacity.
13.2 Universal Coding for Binary Sequences.
13.3 Arithmetic Coding.
13.4 Lempel–Ziv Coding.
13.5 Optimality of Lempel–Ziv Algorithms.
Compression.
Summary.
Problems.
Historical Notes.
14. Kolmogorov Complexity.
14.1 Models of Computation.
14.2 Kolmogorov Complexity: Definitions and Examples.
14.3 Kolmogorov Complexity and Entropy.
14.4 Kolmogorov Complexity of Integers.
14.5 Algorithmically Random and Incompressible Sequences.
14.6 Universal Probability.
14.7 Kolmogorov complexity.
14.9 Universal Gambling.
14.10 Occam’s Razor.
14.11 Kolmogorov Complexity and Universal Probability.
14.12 Kolmogorov Sufficient Statistic.
14.13 Minimum Description Length Principle.
Summary.
Problems.
Historical Notes.
15. Network Information Theory.
15.1 Gaussian Multiple-User Channels.
15.2 Jointly Typical Sequences.
15.3 Multiple-Access Channel.
15.4 Encoding of Correlated Sources.
15.5 Duality Between Slepian–Wolf Encoding and Multiple-Access Channels.
15.6 Broadcast Channel.
15.7 Relay Channel.
15.8 Source Coding with Side Information.
15.9 Rate Distortion with Side Information.
15.10 General Multiterminal Networks.
Summary.
Problems.
Historical Notes.
16. Information Theory and Portfolio Theory.
16.1 The Stock Market: Some Definitions.
16.2 Kuhn–Tucker Characterization of the Log-Optimal Portfolio.
16.3 Asymptotic Optimality of the Log-Optimal Portfolio.
16.4 Side Information and the Growth Rate.
16.5 Investment in Stationary Markets.
16.6 Competitive Optimality of the Log-Optimal Portfolio.
16.7 Universal Portfolios.
16.8 Shannon–McMillan–Breiman Theorem (General AEP).
Summary.
Problems.
Historical Notes.
17. Inequalities in Information Theory.
17.1 Basic Inequalities of Information Theory.
17.2 Differential Entropy.
17.3 Bounds on Entropy and Relative Entropy.
17.4 Inequalities for Types.
17.5 Combinatorial Bounds on Entropy.
17.6 Entropy Rates of Subsets.
17.7 Entropy and Fisher Information.
17.8 Entropy Power Inequality and Brunn–Minkowski Inequality.
17.9 Inequalities for Determinants.
17.10 Inequalities for Ratios of Determinants.
Summary.
Problems.
Historical Notes.
Bibliography.
List of Symbols.
Index.
商品描述(中文翻譯)
描述
這本經典教材的最新版本更新了新的問題集和材料
這本基礎教材的第二版保持了清晰、引人思考的教學傳統。讀者再次獲得了數學、物理、統計和資訊理論的混合教學。詳細介紹了資訊理論中的所有基本主題，包括熵、資料壓縮、通道容量、速率失真、網絡資訊理論和假設檢驗。作者為讀者提供了對基礎理論和應用的扎實理解。每章結束時的問題集和電報式摘要進一步幫助讀者。每章後面的歷史注釋總結了主要觀點。
第二版特點：
* 重新組織章節以改善教學
* 200個新問題
* 新的源編碼、投資組合理論和反饋容量材料
* 更新的參考文獻
現在的第二版增強了當前的內容，仍然是電氣工程、統計學和電信學高年級本科和研究生課程的理想教材。
目錄
第二版前言。
第一版前言。
第二版致謝。
第一版致謝。
1. 引言和預覽。
1.1 本書預覽。
2. 熵、相對熵和互信息。
2.1 熵。
2.2 聯合熵和條件熵。
2.3 相對熵和互信息。
2.4 熵和互信息之間的關係。
2.5 熵、相對熵和互信息的鏈式規則。
2.6 Jensen不等式及其結果。
2.7 對數和不等式及其應用。
2.8 數據處理不等式。
2.9 充分統計量。
2.10 Fano不等式。
摘要。
問題。
歷史注釋。
3. 漸近等分性質。
3.1 漸近等分性質定理。
3.2 漸近等分性質的結果：數據壓縮。
