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

Problems of Information Transmission最新文献

筛选
英文 中文
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":"56 1","pages":"1 - 12"},"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
Some q-ary Cyclic Codes from Explicit Monomials over $$mathbb{F}_{q}m$$Fqm $$mathbb{F}_{q}m$$ Fqm上若干显式单项式的q元循环码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-10-16 DOI: 10.1134/s0032946019030050
Lanqiang Li, Shixin Zhu, Li Liu, X. Kai
{"title":"Some q-ary Cyclic Codes from Explicit Monomials over $$mathbb{F}_{q}m$$Fqm","authors":"Lanqiang Li, Shixin Zhu, Li Liu, X. Kai","doi":"10.1134/s0032946019030050","DOIUrl":"https://doi.org/10.1134/s0032946019030050","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"254-274"},"PeriodicalIF":1.2,"publicationDate":"2019-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/s0032946019030050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42480478","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 Lower Bounds on the Spectrum of a Binary Code 二进制码谱的下界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-10-01 DOI: 10.1134/S0032946019040033
M. Burnashev
{"title":"On Lower Bounds on the Spectrum of a Binary Code","authors":"M. Burnashev","doi":"10.1134/S0032946019040033","DOIUrl":"https://doi.org/10.1134/S0032946019040033","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"366 - 375"},"PeriodicalIF":1.2,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019040033","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46421099","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
Search for a Moving Element with the Minimum Total Cardinality of Tests 搜索具有最小测试总基数的移动元素
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-10-01 DOI: 10.1134/S0032946019040057
A. Lebedev, V. Lebedev
{"title":"Search for a Moving Element with the Minimum Total Cardinality of Tests","authors":"A. Lebedev, V. Lebedev","doi":"10.1134/S0032946019040057","DOIUrl":"https://doi.org/10.1134/S0032946019040057","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"396 - 400"},"PeriodicalIF":1.2,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41566007","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 a Frankl-Wilson Theorem 关于Frankl-Wilson定理
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-10-01 DOI: 10.1134/S0032946019040045
A. Sagdeev
{"title":"On a Frankl-Wilson Theorem","authors":"A. Sagdeev","doi":"10.1134/S0032946019040045","DOIUrl":"https://doi.org/10.1134/S0032946019040045","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"376 - 395"},"PeriodicalIF":1.2,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019040045","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41701738","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
Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields 熵与压缩:Khinchin-Ornstein-Shields不等式的一个简单证明
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-07-10 DOI: 10.1134/S0032946020010020
R. Aragona, Francesca Marzi, F. Mignosi, M. Spezialetti
{"title":"Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields","authors":"R. Aragona, Francesca Marzi, F. Mignosi, M. Spezialetti","doi":"10.1134/S0032946020010020","DOIUrl":"https://doi.org/10.1134/S0032946020010020","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"56 1","pages":"13 - 22"},"PeriodicalIF":1.2,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020010020","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42358726","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
Traceability Codes and Their Generalizations 可追溯性代码及其概括
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-07-01 DOI: 10.1134/S0032946019030074
G. Kabatiansky
{"title":"Traceability Codes and Their Generalizations","authors":"G. Kabatiansky","doi":"10.1134/S0032946019030074","DOIUrl":"https://doi.org/10.1134/S0032946019030074","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"283 - 294"},"PeriodicalIF":1.2,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019030074","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64159867","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}
引用次数: 9
RETRACTED ARTICLE: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo 撤下的文章:N. Alon和M. Capalbo对“更小的显式超集中者”的注释
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-07-01 DOI: 10.1134/S0032946019030086
L. Bassalygo
{"title":"RETRACTED ARTICLE: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo","authors":"L. Bassalygo","doi":"10.1134/S0032946019030086","DOIUrl":"https://doi.org/10.1134/S0032946019030086","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"295 - 297"},"PeriodicalIF":1.2,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019030086","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64160123","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
Optimal Upper Bounds for the Divergence of Finite-Dimensional Distributions under a Given Variational Distance 给定变分距离下有限维分布发散性的最优上界
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-07-01 DOI: 10.1134/S0032946019030025
V. V. Prelov
{"title":"Optimal Upper Bounds for the Divergence of Finite-Dimensional Distributions under a Given Variational Distance","authors":"V. V. Prelov","doi":"10.1134/S0032946019030025","DOIUrl":"https://doi.org/10.1134/S0032946019030025","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"218 - 225"},"PeriodicalIF":1.2,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019030025","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44880783","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
Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes 可分弧、可分码以及弧和码的可拓问题
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2019-07-01 DOI: 10.1134/S0032946019030037
I. Landjev, Assya Rousseva
{"title":"Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes","authors":"I. Landjev, Assya Rousseva","doi":"10.1134/S0032946019030037","DOIUrl":"https://doi.org/10.1134/S0032946019030037","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"55 1","pages":"226 - 240"},"PeriodicalIF":1.2,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946019030037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49473434","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学术官方微信