发布求助
文献互助 智能选刊 最新文献

Probabilistic Methods and Distributed Information最新文献

筛选
英文 中文
Elimination and Robustification Techniques 消除和增强技术
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_3
R. Ahlswede
{"title":"Elimination and Robustification Techniques","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_3","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_3","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123953346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Random Network Coding 随机网络编码
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_17
R. Ahlswede
{"title":"Random Network Coding","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_17","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_17","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115567764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Random Correlated Codes for the AVC and the Compound Channels AVC和复合信道的随机相关码
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_2
R. Ahlswede
{"title":"Random Correlated Codes for the AVC and the Compound Channels","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_2","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_2","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116438698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-standard Decoders 非标准解码器
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_5
R. Ahlswede
{"title":"Non-standard Decoders","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_5","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_5","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126419286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Arbitrarily Varying Channels with Worst Channels 任意变化频道与最差频道
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_4
R. Ahlswede
{"title":"Arbitrarily Varying Channels with Worst Channels","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_4","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_4","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122307737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Slepian-Wolf Theorem for Individual Sequences 单个序列的Slepian-Wolf定理
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_11
R. Ahlswede
{"title":"The Slepian-Wolf Theorem for Individual Sequences","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_11","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_11","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130775894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Wringing Method: An Elementary Proof of the Strong Converse Theorem for Multiple-Access Channels 多址信道强逆定理的一个初等证明
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_12
R. Ahlswede
{"title":"A Wringing Method: An Elementary Proof of the Strong Converse Theorem for Multiple-Access Channels","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_12","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_12","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128554963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ergodic Theory and Encoding of Individual Sequences 个体序列的遍历理论与编码
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_10
R. Ahlswede
{"title":"Ergodic Theory and Encoding of Individual Sequences","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_10","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131174642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Feedback and Correlated Sources 反馈和相关来源
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_6
R. Ahlswede
{"title":"Feedback and Correlated Sources","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_6","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_6","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Classical Work: Edge-Disjoint Branchings, Min-Max Theorems, and Shortest Connection Networks 经典著作:边不相交分支，最小-最大定理，和最短连接网络
Probabilistic Methods and Distributed Information Pub Date : 2018-12-31 DOI: 10.1007/978-3-030-00312-8_20
R. Ahlswede
{"title":"Classical Work: Edge-Disjoint Branchings, Min-Max Theorems, and Shortest Connection Networks","authors":"R. Ahlswede","doi":"10.1007/978-3-030-00312-8_20","DOIUrl":"https://doi.org/10.1007/978-3-030-00312-8_20","url":null,"abstract":"","PeriodicalId":228198,"journal":{"name":"Probabilistic Methods and Distributed Information","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124252355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信