找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coding Theorems of Information Theory; J. Wolfowitz Book 19642nd edition Springer-Verlag Berlin Heidelberg 1964 coding.information.informa

[复制链接]
查看: 53707|回复: 50
发表于 2025-3-21 16:24:20 | 显示全部楼层 |阅读模式
书目名称Coding Theorems of Information Theory
编辑J. Wolfowitz
视频videohttp://file.papertrans.cn/229/228884/228884.mp4
丛书名称Ergebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge
图书封面Titlebook: Coding Theorems of Information Theory;  J. Wolfowitz Book 19642nd edition Springer-Verlag Berlin Heidelberg 1964 coding.information.informa
描述The imminent exhaustion of the first printing of this monograph and the kind willingness of the publishers have presented me with the opportunity to correct a few minor misprints and to make a number of additions to the first edition. Some of these additions are in the form of remarks scattered throughout the monograph. The principal additions are Chapter 11, most of Section 6. 6 (inc1uding Theorem 6. 6. 2), Sections 6. 7, 7. 7, and 4. 9. It has been impossible to inc1ude all the novel and inter­ esting results which have appeared in the last three years. I hope to inc1ude these in a new edition or a new monograph, to be written in a few years when the main new currents of research are more clearly visible. There are now several instances where, in the first edition, only a weak converse was proved, and, in the present edition, the proof of a strong converse is given. Where the proof of the weaker theorem em­ ploys a method of general application and interest it has been retained and is given along with the proof of the stronger result. This is wholly in accord with the purpose of the present monograph, which is not only to prove the principal coding theorems but also, while doing
出版日期Book 19642nd edition
关键词coding; information; information theory; proof; theorem
版次2
doihttps://doi.org/10.1007/978-3-662-00237-7
isbn_ebook978-3-662-00237-7
copyrightSpringer-Verlag Berlin Heidelberg 1964
The information of publication is updating

书目名称Coding Theorems of Information Theory影响因子(影响力)




书目名称Coding Theorems of Information Theory影响因子(影响力)学科排名




书目名称Coding Theorems of Information Theory网络公开度




书目名称Coding Theorems of Information Theory网络公开度学科排名




书目名称Coding Theorems of Information Theory被引频次




书目名称Coding Theorems of Information Theory被引频次学科排名




书目名称Coding Theorems of Information Theory年度引用




书目名称Coding Theorems of Information Theory年度引用学科排名




书目名称Coding Theorems of Information Theory读者反馈




书目名称Coding Theorems of Information Theory读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:28:23 | 显示全部楼层
Springer-Verlag Berlin Heidelberg 1964
发表于 2025-3-22 03:42:17 | 显示全部楼层
发表于 2025-3-22 05:29:12 | 显示全部楼层
发表于 2025-3-22 09:57:19 | 显示全部楼层
Pre-Quaternary Records of Wildfirewhich are basic in published treatments of the subject, but of which no use was made in this monograph. The discussion of Section 5.6 describes the use to which these results are put. A comparison with the methods of Chapter 5 may be instructive.
发表于 2025-3-22 14:13:16 | 显示全部楼层
Sediment Fluxes in Coastal Areasristic discussion of which the present chapter is devoted. In this discussion there will occur terms not yet precisely defined, to which the reader should give their colloquial meaning. This procedure is compatible with the purpose of the present chapter, which is to motivate the problems to be disc
发表于 2025-3-22 18:30:53 | 显示全部楼层
Hervé Regnauld,Giuseppe Mastronuzziinterest in these properties will become apparent in Chapter 3. By at once proving the necessary facts we gain in efficiency at the expense of a temporary lack of motivation. To avoid the trivial we assume, throughout this monograph, that . ≧ 2 and . ≧ 2 ; the main interest in application will usual
发表于 2025-3-22 22:01:32 | 显示全部楼层
Challenges in Modelling Sediment Matters letter for both the collection of c.p.f.’s and the set of their indices. This is not strictly logical, but it will cause no confusion and will keep down the amount of notation to be introduced. We shall throughout adhere to this practice.) Let . . (x., . . . . be any word sent and v (u.) = (Y. . ,
发表于 2025-3-23 01:38:31 | 显示全部楼层
发表于 2025-3-23 06:19:06 | 显示全部楼层
https://doi.org/10.1007/978-3-319-14696-6tively envisioned it as such, and nothing in the channels which we have so far explicitly studied is incom-patible with this. Suppose, however, that a word is being sent after the channel has been in operation for some time. Then some channels may “remember” the past history of the channel, i.e., th
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-19 07:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表