实例介绍
【实例简介】
英文答案，Tomas Cover Joy Tomas所著信息论基础 第二版，学习信息论必备，电子信息专业必学
2 Contents 1 Introduction 2 Entropy, Relative Entropy and Mutual Information 3 The Asymptotic Equipartition Property 49 4 Entropy Rates of a Stochastic Process 61 5 Data Compression 97 6 Gambling and Data Compression 139 CONTENTS Preface The problems in the book, Elements of Information Theory, Second edition, were chosen from the problems used during the course at Stanford. Most of the solutions here were prepared by the graders and instructors of the course. We would particularly like to thank Prof. John Gill, David Evans, Jim Roche, Laura Ekroot and Young Han Kim for their help in preparing these solutions Most of the problems in the book are straightforward, and we have included hints in the problem statement for the difficult problems. In some cases, the solutions include extra material of interest(for example, the problem on coin weighing on Pg. 12) We would appreciate any comments, suggestions and corrections to this Solutions Man ual Tom Cover Joy Thomas Durand 121, Information Systems lab Stratify Stanford University 701N Shoreline avenue Stanford. CA 94305 Mountain view. CA 94043 Ph.415-723-4505 Ph.650-210-2722 FAX:415-723-8473 FAX:650-9882159 Enail: cover@isl. stanford. edu Email: jalastralilycoIn CONTENTS Chapter 1 Introduction Introduction Chapter 2 Entropy, Relative Entropy and Mutual Information Coin flips. A fair coin is dipped until the first head occurs. Let X denote the number of Hips required (a)Find the entropy H(X) in bits. The following expressions may be useful T m=0 (b)A random variable X is drawn according to this distribution. Find an"efficient sequence of yes-no questions of the form, " Is X contained in the set S?" Compare H(X) to the expected number of questions required to determine X Solution: (a)The number X of tosses till the first head appears has the geometric distribution rith parameter p=1/ 2, where P(X =n)=pq",n E(1. 2,..Hence the X H(X) ∑p2-1log ∑m"logp+∑m"logg plogp pg 10g g q p log p-g log q H If p=1/ 2, then H(X)=2 bits 【实例截图】
【核心代码】
英文答案，Tomas Cover Joy Tomas所著信息论基础 第二版，学习信息论必备，电子信息专业必学
2 Contents 1 Introduction 2 Entropy, Relative Entropy and Mutual Information 3 The Asymptotic Equipartition Property 49 4 Entropy Rates of a Stochastic Process 61 5 Data Compression 97 6 Gambling and Data Compression 139 CONTENTS Preface The problems in the book, Elements of Information Theory, Second edition, were chosen from the problems used during the course at Stanford. Most of the solutions here were prepared by the graders and instructors of the course. We would particularly like to thank Prof. John Gill, David Evans, Jim Roche, Laura Ekroot and Young Han Kim for their help in preparing these solutions Most of the problems in the book are straightforward, and we have included hints in the problem statement for the difficult problems. In some cases, the solutions include extra material of interest(for example, the problem on coin weighing on Pg. 12) We would appreciate any comments, suggestions and corrections to this Solutions Man ual Tom Cover Joy Thomas Durand 121, Information Systems lab Stratify Stanford University 701N Shoreline avenue Stanford. CA 94305 Mountain view. CA 94043 Ph.415-723-4505 Ph.650-210-2722 FAX:415-723-8473 FAX:650-9882159 Enail: cover@isl. stanford. edu Email: jalastralilycoIn CONTENTS Chapter 1 Introduction Introduction Chapter 2 Entropy, Relative Entropy and Mutual Information Coin flips. A fair coin is dipped until the first head occurs. Let X denote the number of Hips required (a)Find the entropy H(X) in bits. The following expressions may be useful T m=0 (b)A random variable X is drawn according to this distribution. Find an"efficient sequence of yes-no questions of the form, " Is X contained in the set S?" Compare H(X) to the expected number of questions required to determine X Solution: (a)The number X of tosses till the first head appears has the geometric distribution rith parameter p=1/ 2, where P(X =n)=pq",n E(1. 2,..Hence the X H(X) ∑p2-1log ∑m"logp+∑m"logg plogp pg 10g g q p log p-g log q H If p=1/ 2, then H(X)=2 bits 【实例截图】
【核心代码】
标签：
好例子网口号：伸出你的我的手 — 分享！
小贴士
感谢您为本站写下的评论，您的评论对其它用户来说具有重要的参考价值，所以请认真填写。
- 类似“顶”、“沙发”之类没有营养的文字，对勤劳贡献的楼主来说是令人沮丧的反馈信息。
- 相信您也不想看到一排文字/表情墙，所以请不要反馈意义不大的重复字符，也请尽量不要纯表情的回复。
- 提问之前请再仔细看一遍楼主的说明，或许是您遗漏了。
- 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦，又没人会搭理，于人于己都无利。
关于好例子网
本站旨在为广大IT学习爱好者提供一个非营利性互相学习交流分享平台。本站所有资源都可以被免费获取学习研究。本站资源来自网友分享，对搜索内容的合法性不具有预见性、识别性、控制性，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，平台无法对用户传输的作品、信息、内容的权属或合法性、安全性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论平台是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二与二十三条之规定，若资源存在侵权或相关问题请联系本站客服人员，点此联系我们。关于更多版权及免责申明参见 版权及免责申明
网友评论
我要评论