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

Probl. Inf. Transm.最新文献

筛选
英文 中文
Entropy in Thermodynamics and in Information Theory 热力学和信息论中的熵
Probl. Inf. Transm. Pub Date : 2022-04-01 DOI: 10.1134/s0032946022020016
V. A. Zorich
{"title":"Entropy in Thermodynamics and in Information Theory","authors":"V. A. Zorich","doi":"10.1134/s0032946022020016","DOIUrl":"https://doi.org/10.1134/s0032946022020016","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128903350","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}
引用次数: 4
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel 二进制对称信道中卷积码效率的理论和实验上下界
Probl. Inf. Transm. Pub Date : 2022-04-01 DOI: 10.1134/s003294602202003x
A. Kurmukova, F. Ivanov, V. Zyablov
{"title":"Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel","authors":"A. Kurmukova, F. Ivanov, V. Zyablov","doi":"10.1134/s003294602202003x","DOIUrl":"https://doi.org/10.1134/s003294602202003x","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114601455","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}
引用次数: 1
On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications 短串联重复下演化的不可混淆字符串的最大数目
Probl. Inf. Transm. Pub Date : 2022-04-01 DOI: 10.1134/s0032946022020028
Mladen Kovačević
{"title":"On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications","authors":"Mladen Kovačević","doi":"10.1134/s0032946022020028","DOIUrl":"https://doi.org/10.1134/s0032946022020028","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072040","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}
引用次数: 1
New Modularity Bounds for Graphs G(n, r, s) and Gp(n, r, s) 图G(n, r, s)和Gp(n, r, s)的新模性界
Probl. Inf. Transm. Pub Date : 2021-10-01 DOI: 10.1134/s0032946021040086
N. Derevyanko, M. Koshelev
{"title":"New Modularity Bounds for Graphs G(n, r, s) and Gp(n, r, s)","authors":"N. Derevyanko, M. Koshelev","doi":"10.1134/s0032946021040086","DOIUrl":"https://doi.org/10.1134/s0032946021040086","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116112577","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}
引用次数: 1
On List Decoding of Certain 픽q-Linear Codes 关于某些lq -线性码的列表译码
Probl. Inf. Transm. Pub Date : 2021-10-01 DOI: 10.1134/s0032946021040049
N. Polyanskii
{"title":"On List Decoding of Certain 픽q-Linear Codes","authors":"N. Polyanskii","doi":"10.1134/s0032946021040049","DOIUrl":"https://doi.org/10.1134/s0032946021040049","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668682","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
On the Maximum f-Divergence of Probability Distributions Given the Value of Their Coupling 给定耦合值的概率分布的最大f散度
Probl. Inf. Transm. Pub Date : 2021-10-01 DOI: 10.1134/s0032946021040025
V. V. Prelov
{"title":"On the Maximum f-Divergence of Probability Distributions Given the Value of Their Coupling","authors":"V. V. Prelov","doi":"10.1134/s0032946021040025","DOIUrl":"https://doi.org/10.1134/s0032946021040025","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117002593","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
On Geometric Goppa Codes from Elementary Abelian p-Extensions of 픽ps(x) 基于pl_p (x)的初等Abelian p-扩展的几何Goppa码
Probl. Inf. Transm. Pub Date : 2020-07-01 DOI: 10.1134/S0032946020030035
N. Patanker, S. Singh
{"title":"On Geometric Goppa Codes from Elementary Abelian p-Extensions of 픽ps(x)","authors":"N. Patanker, S. Singh","doi":"10.1134/S0032946020030035","DOIUrl":"https://doi.org/10.1134/S0032946020030035","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123904369","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 Sphere Packing Bound For Memoryless Channels 球体包装为无记忆通道
Probl. Inf. Transm. Pub Date : 2018-04-17 DOI: 10.1134/S0032946020030011
Barış Nakiboğlu
{"title":"The Sphere Packing Bound For Memoryless Channels","authors":"Barış Nakiboğlu","doi":"10.1134/S0032946020030011","DOIUrl":"https://doi.org/10.1134/S0032946020030011","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651817","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}
引用次数: 20
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel 任意变化信道上有限块长有损联合信信道编码的极大极小定理
Probl. Inf. Transm. Pub Date : 1900-01-01 DOI: 10.1134/S0032946021020010
Anuj S. Vora, Ankur A. Kulkarni
{"title":"Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel","authors":"Anuj S. Vora, Ankur A. Kulkarni","doi":"10.1134/S0032946021020010","DOIUrl":"https://doi.org/10.1134/S0032946021020010","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134530572","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
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance 非最大码距子空间码的基数界
Probl. Inf. Transm. Pub Date : 1900-01-01 DOI: 10.1134/s0032946021030030
E. Gabidulin, N. Pilipchuk, O. Trushina
{"title":"Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance","authors":"E. Gabidulin, N. Pilipchuk, O. Trushina","doi":"10.1134/s0032946021030030","DOIUrl":"https://doi.org/10.1134/s0032946021030030","url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121602963","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学术文献互助群
群 号：481959085
Book学术官方微信