Name: Elements of Information Theory
ISBN: 9780471241959

作者: Thomas M. Cover / Joy A. Thomas
出版社: Wiley-Blackwell
出版年: 2006-7
页数: 776
定价: GBP 76.50
装帧: Hardcover
丛书: Wiley Series in Telecommunications and Signal Processing
ISBN: 9780471241959

豆瓣评分

8.9

95人评价

5星

55.8%
4星

38.9%
3星

3.2%
2星

2.1%
1星

0.0%

评价:

内容简介 · · · · · ·

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 i...

(展开全部)

豆瓣成员常用的标签(共83个) · · · · · ·

信息论 Information 数学计算机科学计算机 Theory 算法 CS

丛书信息

　　Wiley Series in Telecommunications and Signal Processing (共15册), 这套丛书还有《Optical Communications》,《Mobile Communications Design Fundamentals (Wiley Series in Telecommunications and Signal Processing)》,《Polynomial Signal Processing》,《Digital Signal Processing》,《Digital Communication over Fading Channels (Wiley Series in Telecommunications and Signal Processing)》等。

喜欢读"Elements of Information Theory"的人也喜欢的电子书 · · · · · ·

支持 Web、iPhone、iPad、Android 阅读器

: 图灵的秘密

29.99元

: CoffeeScript小书

1.99元

喜欢读"Elements of Information Theory"的人也喜欢 · · · · · ·

: Information Theory, Inference and ...

: Convex Optimization

: 信息论基础

: Probabilistic Graphical Models

: Introduction to Scientific Programm...

: Multiagent Systems

: The Elements of Statistical Learnin...

: Hacking Vim 7.2

: R Packages

: Learning Deep Architectures for AI

我来说两句

短评 · · · · · · ( 全部 27 条 )

Elements of Information Theory的话题 · · · · · · ( 全部条 )

什么是话题

无论是一部作品、一个人，还是一件事，都往往可以衍生出许多不同的话题。将这些话题细分出来，分别进行讨论，会有更多收获。

我要写书评

Elements of Information Theory的书评 · · · · · · ( 全部 8 条 )

我怎么不觉得这本是入门教材？

刚刚读完这本书，的确是一本好书，把信息论的主要思想，以及这些思想在包括博弈、金融、数学、物理、算法复杂性等理论的应用都讲出来了，而且能够把信息论之中蕴含的深刻科学思想讲出来，的确是一本好书。但我认为，这本书仍然存在以下一些不足之处： 1、这并不是一本入门级别... (展开)

2 27回应

[已注销] 2010-03-02 14:42:22 机械工业出版社2005版

难得写出信息论思想的好书

目前正在读，感觉写的非常好。适合本科高年级或者研究生的信息论的入门书籍。和国内的一些教材不同，该书并非简单的堆砌定理以及数学概念，而能更深刻的介绍概念定理背后的哲学思想以及实际意义。从形而上至形而下，相当全方位的将信息论的思想展现出来。此书适合精读，熵，... (展开)

1 2回应

橡皮人 2014-01-10 13:40:58 机械工业出版社2008版

信息论基础评分：8.5 权重8

这篇书评可能有关键情节透露

信息论基础评分：8.5 权重8 （课程共耗时6361，其中本书2339）从课程讲到典型集之后换用这本书学信息论部分。目前只自己看了这本书的很小一部分，包括二三五七章的部分。使用了本书之后感觉《信息论与编码理论》真是本傻逼教材，受不了它了。。这本书总体比信息论与编码的书... (展开)

3 2回应

djin 2012-06-26 23:13:52

还是要看过五遍以上的人来评价好不好……

比起同类书，是相当容易懂。但是数学的条理逻辑性就不明显了。具体说来，其他书基本都是直接先把用到的数学基础摆出来，在后面章节中直接用（如El Gamal & Kim的NETWORK INFORMATION THEORY）。而这本书不是的。组织结构上可能有些难以把握。仅仅在通信上的应用，最起码包括... (展开)

1 1回应

水上漂 2007-12-02 16:21:49 机械工业出版社2005版

这可是信息论权威著作啊！

Cover先生是牛人，IEEE的Fellow。这本书网上也有英文的电子版。可以试一试直接看英文版。也是不错的。讲的最后两章指明了现在和将来信息论可能的研究方向。 (展开)

1 0回应

思源 2007-01-28 13:36:25 机械工业出版社2005版

这本书是学习信息技术的基础

虽然概念比较难懂，但如果能找到切入点很容易明白。建议看 www.googlechinablog.com 的数学之美系列文章。 (展开)

1 3回应

Tristan Qiu 2009-11-14 06:42:41

信息论入门标准教材

公认的书中包括的内容极其丰富并且定理推导都不算复杂可谓是初学者接触信息论的最好教材再加上是二版这个是标准的美版哎只可惜俺没钱买长期只能pdf…… (展开)

1 2回应

[已注销] 2009-09-22 09:46:43 机械工业出版社2005版

蛮好懂的书

感觉挺明白浅显的，本科的老师用的这本教材，不过她明显没有好好备课，讲的乱七八糟的，都是自己看的，还不错，现在还记得一些印象。不过我对翻译的书都没什么好印象，所以还是建议大家去读英文版的吧。 (展开)

1 0回应

> 更多书评 8篇

读书笔记 · · · · · · (共5篇)

我来写笔记

按有用程度
按页码先后
最新笔记

展开收起
第5页

Qingcheng (Give me some sunshine!!!)

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication. The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the s...
2014-05-23 09:38

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication.
The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the string.
Entropy is the uncertainty of a single random variable.
A communication channel is a system in which the output depends probabilistically on its input.
The entropy H of a random variable is a lower bound on the average length of the shortest description of the random variable.

推荐

回应 2014-05-23 09:38
展开收起
第58页

OrangeCLK

We summarize this by saying, "Almost all events are almost equally suprising."
2013-12-21 03:47

We summarize this by saying, "Almost all events are almost equally suprising."

推荐

回应 2013-12-21 03:47
展开收起
第3页

OrangeCLK

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！
2013-12-21 03:46

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！

推荐

回应 2013-12-21 03:46
展开收起
Ch 2

小鱼吃虾米 (夏天，我来啦)

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable....
2013-10-26 02:52

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable. Mutual information is a special case of a more general quantity called relative entropy, which is a measure of the distance between two probability distributions.

推荐

回应 2013-10-26 02:52

展开收起
第3页

OrangeCLK

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！
2013-12-21 03:46

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！

推荐

回应 2013-12-21 03:46
展开收起
第5页

Qingcheng (Give me some sunshine!!!)

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication. The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the s...
2014-05-23 09:38

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication.
The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the string.
Entropy is the uncertainty of a single random variable.
A communication channel is a system in which the output depends probabilistically on its input.
The entropy H of a random variable is a lower bound on the average length of the shortest description of the random variable.

推荐

回应 2014-05-23 09:38
展开收起
第58页

OrangeCLK

We summarize this by saying, "Almost all events are almost equally suprising."
2013-12-21 03:47

We summarize this by saying, "Almost all events are almost equally suprising."

推荐

回应 2013-12-21 03:47
展开收起
Ch 2

小鱼吃虾米 (夏天，我来啦)

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable....
2013-10-26 02:52

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable. Mutual information is a special case of a more general quantity called relative entropy, which is a measure of the distance between two probability distributions.

推荐

回应 2013-10-26 02:52

展开收起
第5页

Qingcheng (Give me some sunshine!!!)

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication. The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the s...
2014-05-23 09:38

The initial questions treated by information theory lay in the areas of data compression and transmission. The answers are quantities such as entropy and mutual information, which are functions of the probability distributions that underlie the process of communication.
The Kol-mogorov complexity of a binary string is defined as the length of the shortest computer program that prints out the string.
Entropy is the uncertainty of a single random variable.
A communication channel is a system in which the output depends probabilistically on its input.
The entropy H of a random variable is a lower bound on the average length of the shortest description of the random variable.

推荐

回应 2014-05-23 09:38
展开收起
第58页

OrangeCLK

We summarize this by saying, "Almost all events are almost equally suprising."
2013-12-21 03:47

We summarize this by saying, "Almost all events are almost equally suprising."

推荐

回应 2013-12-21 03:47
展开收起
第3页

OrangeCLK

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！
2013-12-21 03:46

Kolmogorov Complexity如此本质，我以前居然没有听说过。Kolmogorov太了不起了！

推荐

回应 2013-12-21 03:46
展开收起
Ch 2

小鱼吃虾米 (夏天，我来啦)

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable....
2013-10-26 02:52

However, for any probability distribution, we define a quantity called the entropy, which has many properties that agree with the intuitive notion of what a measure of information should be. This notion is extended to define mutual information, which is a measure of the amount of information one random variable contains about another. Entropy then becomes the self-information of a random variable. Mutual information is a special case of a more general quantity called relative entropy, which is a measure of the distance between two probability distributions.

推荐

回应 2013-10-26 02:52