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

Problems of Information Transmission最新文献

筛选
英文 中文
Research on Fractional Critical Covered Graphs 分数临界覆盖图的研究
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-07-01 DOI: 10.1134/S0032946020030047
S. Wang, W. Zhang
{"title":"Research on Fractional Critical Covered Graphs","authors":"S. Wang, W. Zhang","doi":"10.1134/S0032946020030047","DOIUrl":"https://doi.org/10.1134/S0032946020030047","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020030047","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49439961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 42
Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter 给相对论观察者的信号:爱因斯坦-香农-黎曼相遇
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-05-07 DOI: 10.1134/S0032946020040018
Mladen Kovačević
{"title":"Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter","authors":"Mladen Kovačević","doi":"10.1134/S0032946020040018","DOIUrl":"https://doi.org/10.1134/S0032946020040018","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43876721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Comparison of Contraction Coefficients for f-Divergences f-散度收缩系数的比较
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-04-01 DOI: 10.1134/S0032946020020015
A. Makur, L. Zheng
{"title":"Comparison of Contraction Coefficients for f-Divergences","authors":"A. Makur, L. Zheng","doi":"10.1134/S0032946020020015","DOIUrl":"https://doi.org/10.1134/S0032946020020015","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020020015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42922776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis 基于原生图分析的QC-LDPC码Tanner图中长度为8的周期检测
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-04-01 DOI: 10.1134/S0032946020020039
A. Kharin, K. Zavertkin, A. Ovinnikov
{"title":"Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis","authors":"A. Kharin, K. Zavertkin, A. Ovinnikov","doi":"10.1134/S0032946020020039","DOIUrl":"https://doi.org/10.1134/S0032946020020039","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020020039","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44186974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
New Upper Bounds in the Hypothesis Testing Problem with Information Constraints 信息约束下假设检验问题的新上界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-04-01 DOI: 10.1134/S0032946020020027
M. Burnashev
{"title":"New Upper Bounds in the Hypothesis Testing Problem with Information Constraints","authors":"M. Burnashev","doi":"10.1134/S0032946020020027","DOIUrl":"https://doi.org/10.1134/S0032946020020027","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020020027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49085158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis 基于协议分析的QC-LDPC码Tanner图中长度为10的循环检测
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-04-01 DOI: 10.1134/S0032946020040031
A. Kharin, K. Zavertkin, A. Ovinnikov
{"title":"Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis","authors":"A. Kharin, K. Zavertkin, A. Ovinnikov","doi":"10.1134/S0032946020040031","DOIUrl":"https://doi.org/10.1134/S0032946020040031","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49004370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Adaptive Estimation of Linear Functionals from Observations against White Noise 基于观测值的线性泛函自适应白噪声估计
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-04-01 DOI: 10.1134/S0032946020020040
G. Golubev
{"title":"On Adaptive Estimation of Linear Functionals from Observations against White Noise","authors":"G. Golubev","doi":"10.1134/S0032946020020040","DOIUrl":"https://doi.org/10.1134/S0032946020020040","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020020040","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64160001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Extended Large Deviation Principle for Trajectories of Processes with Independent and Stationary Increments on the Half-line 半直线上具有独立平稳增量过程轨迹的扩展大偏差原理
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-01-01 DOI: 10.1134/S0032946020010068
F. Klebaner, A. Logachov, A. Mogulskii
{"title":"Extended Large Deviation Principle for Trajectories of Processes with Independent and Stationary Increments on the Half-line","authors":"F. Klebaner, A. Logachov, A. Mogulskii","doi":"10.1134/S0032946020010068","DOIUrl":"https://doi.org/10.1134/S0032946020010068","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020010068","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48424188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Distance Distributions of Orthogonal Arrays 关于正交阵列的距离分布
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-01-01 DOI: 10.1134/S0032946020010056
N. Manev
{"title":"On Distance Distributions of Orthogonal Arrays","authors":"N. Manev","doi":"10.1134/S0032946020010056","DOIUrl":"https://doi.org/10.1134/S0032946020010056","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020010056","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46300471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On the Maximum Values of f-Divergence and Rényi Divergence under a Given Variational Distance 给定变分距离下f-散度和Rényi散度的最大值
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2020-01-01 DOI: 10.1134/S0032946020010019
V. V. Prelov
{"title":"On the Maximum Values of f-Divergence and Rényi Divergence under a Given Variational Distance","authors":"V. V. Prelov","doi":"10.1134/S0032946020010019","DOIUrl":"https://doi.org/10.1134/S0032946020010019","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020010019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48669399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信