图书介绍

信息和编码理论 英文【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

信息和编码理论 英文
  • GarethA.Jones，J.MaryJones编著 著
  • 出版社： 北京：清华大学出版社
  • ISBN：9787302214885
  • 出版时间：2009
  • 标注页数：210页
  • 文件大小：7MB
  • 文件页数：220页
  • 主题词：信息论－高等学校－教材－英文；信源编码－编码理论－高等学校－教材－英文；信道编码－编码理论－高等学校－教材－英文

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示：（请使用BT下载软件FDM进行下载）软件下载地址页直链下载[便捷但速度慢]  [在线试读本书]   [在线获取解压码]
点击复制MD5值：74453f300faab818cdffa69b56568879

下载说明

信息和编码理论 英文PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

点击复制85GB完整离线版磁力链接到迅雷FDM等BT下载工具进行下载  详情点击-查看共享计划
建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！

（文件页数 要大于 标注页数，上中下等多册电子书除外）

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

图书目录

1．Source Coding1

1.1 Definitions and Examples1

1.2 Uniquely Decodable Codes4

1.3 Instantaneous Codes9

1.4 Constructing Instantaneous Codes11

1.5 Kraft's Inequality13

1.6 McMillan's Inequality14

1.7 Comments on Kraft's and McMillan's Inequalities16

1.8 Supplementary Exercises17

2．Optimal Codes19

2.1 Optimality19

2.2 Binary Huffman Codes22

2.3 Average Word-length of Huffman Codes26

2.4 Optimality of Binary Huffman Codes27

2.5 r-ary Huffman Codes28

2.6 Extensions of Sources30

2.7 Supplementary Exercises32

3．Entropy35

3.1 Information and Entropy35

3.2 Properties of the Entropy Function40

3.3 Entropy and Average Word-length42

3.4 Shannon-Fano Coding45

3.5 Entropy of Extensions and Products47

3.6 Shannon's First Theorem48

3.7 An Example of Shannon's First Theorem49

3.8 Supplementary Exercises51

4．Information Channels55

4.1 Notation and Definitions55

4.2 The Binary Symmetric Channel60

4.3 System Entropies62

4.4 System Entropies for the Binary Symmetric Channel64

4.5 Extension of Shannon's First Theorem to Information Channels67

4.6 Mutual Information70

4.7 Mutual Information for the Binary Symmetric Channel72

4.8 Channel Capacity73

4.9 Supplementary Exercises76

5．Using an Unreliable Channel79

5.1 Decision Rules79

5.2 An Example of Improved Reliability82

5.3 Hamming Distance85

5.4 Statement and Outline Proof of Shannon's Theorem88

5.5 The Converse of Shannon's Theorem90

5.6 Comments on Shannon's Theorem93

5.7 Supplementary Exercises94

6．Error-correcting Codes97

6.1 Introductory Concepts97

6.2 Examples of Codes100

6.3 Minimum Distance104

6.4 Hamming's Sphere-packing Bound107

6.5 The Gilbert-Varshamov Bound111

6.6 Hadamard Matrices and Codes114

6.7 Supplementary Exercises118

7．Linear Codes121

7.1 Matrix Description of Linear Codes121

7.2 Equivalence of Linear Codes127

7.3 Minimum Distance of Linear Codes131

7.4 The Hamming Codes133

7.5 The Golay Codes136

7.6 The Standard Array141

7.7 Syndrome Decoding143

7.8 Supplementary Exercises146

Suggestions for Further Reading149

Appendix A．Proof of the Sardinas-Patterson Theorem153

Appendix B．The Law of Large Numbers157

Appendix C．Proof of Shannon's Fundamental Theorem159

Solutions to Exercises165

Bibliography191

Index of Symbols and Abbreviations195

Index201

热门推荐