首页 > 最新文献

Problems of Information Transmission最新文献

英文 中文
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform 快速霍夫变换中并矢模式的性质分析
IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"292 - 300"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"373 - 379"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"248 - 264"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Problems of Information Transmission
Pub Date : 2021-04-03 DOI: 10.1134/s0032946021010038
V. V. Prelov

We consider the problem of finding the minimum and maximum values of f-divergence for discrete probability distributions P and Q provided that one of these distributions and the value of their coupling are given. An explicit formula for the minimum value of the f-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 χ2 divergences, which are the most important cases of the f-divergence.

考虑离散概率分布P和Q的f散度的最小值和最大值问题，条件是给定其中一个分布及其耦合值。得到了上述条件下f-散度最小值的显式表达式，以及f-散度最大值的精确表达式。这个精确的表达式在一般情况下并不显式，但在许多特殊情况下，它允许我们写出显式公式和简单的上界，这有时是最优的。对于f-散度最重要的情况Kullback-Leibler散度和χ2散度，也得到了类似的显式公式和上界。
{"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":"8 22","pages":""},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Problems of Information Transmission
Pub Date : 2021-04-03 DOI: 10.1134/s0032946021010051
N. Patanker, S. K. Singh

We estimate the minimum distance of primary monomial affine variety codes defined from a hyperelliptic curve ({x^5} + x - {y^2}) over (mathbb{F}_7). 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.

我们估计了从超椭圆曲线上定义的初级单次仿射变异码的最小距离 ({x^5} + x - {y^2}) 结束 (mathbb{F}_7)． 为了估计码的最小距离，我们应用符号计算实现Geil和Özbudak提出的技术。对于其中的一些码，我们也得到了符号对距离。进一步给出了构造码的广义汉明权值的下界。所提出的广义汉明权值的计算方法适用于任何原生单仿射变码。
{"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":"8 23","pages":""},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"143 - 160"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"136 - 142"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"129 - 135"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"161 - 177"},"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区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
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":"57 1","pages":"33 - 53"},"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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Problems of Information Transmission
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1