经典的信息论课程书籍,作者是斯坦福大学的Thomas M . Cover and Hoy A. Thomas。里面有书籍和对应的答案。书籍为第二版,最新版
2021-10-21 17:01:10 5.77MB information theory Thomas M.
1
GTM Hungerford Algebra 英文 可搜索版本
2021-10-13 21:02:33 74.12MB algebra GTM
1
数字电路第九版中文 Thomas L.Floyd,注意是中文版的教材,解压密码为111
2021-10-04 00:46:33 64.4MB pdf
1
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. An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department.
2021-10-03 23:33:33 6.27MB 信息论基础
1
tridiagonal 解决三对角线性系统 为了 使用三对角矩阵算法(即托马斯算法)。 句法 x = tridiagonal(A,d) 描述 x = tridiagonal(A,d)求解三对角线形系统 为了 (一个 向量),其中 是一个三对角矩阵, 。 。 三对角矩阵约定 对于此实现,我使用以下约定表示三对角矩阵的元素 : 大多数参考,包括下面列出的两个,都有 的范围从 至 在三对角矩阵的定义和用于求解相应线性系统的算法中都是如此。 在此实现中, 的范围从 至 ; 这使得该算法的实现更加简单明了。 附加文档和示例 有关其他文档和示例,请参见“ DOCUMENTATION.pdf”。
2021-09-23 05:09:23 237KB matlab
1
该函数使用托马斯算法求解函数。 使用三对角矩阵获得解。 所需的输入是时间和空间离散化以及最终时间。
2021-09-23 01:37:21 1KB matlab
1
第二版答案Coin flips. A fair coin is flipped until the first head occurs. Let X denote the number of flips required. (a) Find the entropy H(X) in bits. The following expressions may be useful
2021-09-19 16:57:24 1.81MB 信息论
1
GTM73, Thomas W.Hungerford, Algebra.rar GTM73, Thomas W.Hungerford, Algebra.rar
2021-09-17 15:00:06 21.1MB 抽象代数 高等代数
1
这是 数字电子技术 第十版 Thomas L.Floyd著 的全部课后答案[1-14章],但是内容是英文版的,和中文版教材有点小差别不影响使用。 ,希望对大家有帮助,欢迎下载或者永久保存。
2021-09-11 10:17:43 5.21MB 数字电子技术第十版
1
书好效果也很好, 1 Introduction and Preview 1 1.1 Preview of the Book 5 2 Entropy, Relative Entropy, and Mutual Information 2.1 Entropy 13 2.2 Joint Entropy and Conditional Entropy 16 2.3 Relative Entropy and Mutual Information 19 2.4 Relationship Between Entropy and Mutual Information 20 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information 22 2.6 Jensen’s Inequality and Its Consequences 25 2.7 Log Sum Inequality and Its Applications 30 2.8 Data-Processing Inequality 34 2.9 Sufficient Statistics 35 2.10 Fano’s Inequality 37 Summary 41 Problems 43 Historical Notes 54
2021-09-07 19:49:26 10.09MB T. Cover J. Thomas
1