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

Problems of Information Transmission最新文献

筛选
英文 中文
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform 快速霍夫变换中并矢模式的性质分析
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-07-01 DOI: 10.1134/S0032946021030078
S. Karpenko, E. Ershov
{"title":"Analysis of Properties of Dyadic Patterns for the Fast Hough Transform","authors":"S. Karpenko, E. Ershov","doi":"10.1134/S0032946021030078","DOIUrl":"https://doi.org/10.1134/S0032946021030078","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64160639","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
New Turán Type Bounds for Johnson Graphs 约翰逊图的新Turán类型边界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-06-04 DOI: 10.1134/S0032946021040074
N. Dubinin
{"title":"New Turán Type Bounds for Johnson Graphs","authors":"N. Dubinin","doi":"10.1134/S0032946021040074","DOIUrl":"https://doi.org/10.1134/S0032946021040074","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45751587","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 Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals 关于高斯随机序列和高斯平稳信号的Minimax检测
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-13 DOI: 10.1134/S0032946021030042
M. Burnashev
{"title":"On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals","authors":"M. Burnashev","doi":"10.1134/S0032946021030042","DOIUrl":"https://doi.org/10.1134/S0032946021030042","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44937252","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
The f -Divergence and Coupling of Probability Distributions 概率分布的f -散度与耦合
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-03 DOI: 10.1134/s0032946021010038
V. V. Prelov
{"title":"The f -Divergence and Coupling of Probability Distributions","authors":"V. V. Prelov","doi":"10.1134/s0032946021010038","DOIUrl":"https://doi.org/10.1134/s0032946021010038","url":null,"abstract":"<p>We consider the problem of finding the minimum and maximum values of <i>f</i>-divergence for discrete probability distributions <i>P</i> and <i>Q</i> provided that one of these distributions and the value of their coupling are given. An explicit formula for the minimum value of the <i>f</i>-divergence under the above conditions is obtained, as well as a precise expression for its maximum value. This precise expression is not explicit in the general case, but in many special cases it allows us to write out both explicit formulas and simple upper bounds, which are sometimes optimal. Similar explicit formulas and upper bounds are also obtained for the Kullback–Leibler and χ<sup>2</sup> divergences, which are the most important cases of the <i>f</i>-divergence.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138494947","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
Affine Variety Codes over a Hyperelliptic Curve 超椭圆曲线上的仿射变异码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-03 DOI: 10.1134/s0032946021010051
N. Patanker, S. K. Singh
{"title":"Affine Variety Codes over a Hyperelliptic Curve","authors":"N. Patanker, S. K. Singh","doi":"10.1134/s0032946021010051","DOIUrl":"https://doi.org/10.1134/s0032946021010051","url":null,"abstract":"<p>We estimate the minimum distance of primary monomial affine variety codes defined from a hyperelliptic curve <span>({x^5} + x - {y^2})</span> over <span>(mathbb{F}_7)</span>. To estimate the minimum distance of the codes, we apply symbolic computations implementing the techniques suggested by Geil and Özbudak. For some of these codes, we also obtain the symbol-pair distance. Furthermore, lower bounds on the generalized Hamming weights of the constructed codes are obtained. The proposed method to calculate the generalized Hamming weights can be applied to any primary monomial affine variety codes.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138494946","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
Counting the Number of Perfect Matchings, and Generalized Decision Trees 完美匹配数的计算与广义决策树
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-01 DOI: 10.1134/S0032946021020046
M. Vyalyi
{"title":"Counting the Number of Perfect Matchings, and Generalized Decision Trees","authors":"M. Vyalyi","doi":"10.1134/S0032946021020046","DOIUrl":"https://doi.org/10.1134/S0032946021020046","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64160358","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
Bounds on Borsuk Numbers in Distance Graphs of a Special Type 一类特殊类型距离图中Borsuk数的界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-01 DOI: 10.1134/S0032946021020034
A. Berdnikov, A. Raigorodskii
{"title":"Bounds on Borsuk Numbers in Distance Graphs of a Special Type","authors":"A. Berdnikov, A. Raigorodskii","doi":"10.1134/S0032946021020034","DOIUrl":"https://doi.org/10.1134/S0032946021020034","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44142826","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}
引用次数: 8
Coding in a Z-Channel in Case of Many Errors 多错误情况下的Z通道编码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-01 DOI: 10.1134/S0032946021020022
V. Lebedev, N. Polyanskii
{"title":"Coding in a Z-Channel in Case of Many Errors","authors":"V. Lebedev, N. Polyanskii","doi":"10.1134/S0032946021020022","DOIUrl":"https://doi.org/10.1134/S0032946021020022","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47549923","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
Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges 边权随机的有向图上最大路径权的极限定理
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-04-01 DOI: 10.1134/S0032946021020058
T. Konstantopoulos, A. Logachov, A. Mogulskii, S. Foss
{"title":"Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges","authors":"T. Konstantopoulos, A. Logachov, A. Mogulskii, S. Foss","doi":"10.1134/S0032946021020058","DOIUrl":"https://doi.org/10.1134/S0032946021020058","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43069917","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
Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost 异构分布式存储系统存储与维修成本的权衡
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2021-01-01 DOI: 10.1134/S0032946021010026
K. Benerjee, M. K. Gupta
{"title":"Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost","authors":"K. Benerjee, M. K. Gupta","doi":"10.1134/S0032946021010026","DOIUrl":"https://doi.org/10.1134/S0032946021010026","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42024172","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信