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

Problems of Information Transmission最新文献

筛选
英文 中文
Prediction of Locally Stationary Data Using Expert Advice 利用专家建议预测局部静态数据
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s0032946024010058
V. V. V’yugin, V. G. Trunov, R. D. Zukhba
{"title":"Prediction of Locally Stationary Data Using Expert Advice","authors":"V. V. V’yugin, V. G. Trunov, R. D. Zukhba","doi":"10.1134/s0032946024010058","DOIUrl":"https://doi.org/10.1134/s0032946024010058","url":null,"abstract":"<p>We address the lifelong machine learning problem. Within the game-theoretic approach, in the calculation of the next prediction we use no assumptions on the stochastic nature of a source that generates the data flow: the source can be either analog, or algorithmic, or probabilistic; its parameters can change at random times; when constructing a prediction model, only structural assumptions are used about the nature of data generation. We present an online forecasting algorithm for a locally stationary time series. We also obtain an estimate for the efficiency of the proposed algorithm. The obtained estimates for the regret of the algorithm are illustrated by results of numerical experiments.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938741","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
Constructions of Nonbinary Codes Meeting the Johnson Bound 符合约翰逊边界的非二进制代码构造
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s0032946024010022
L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev
{"title":"Constructions of Nonbinary Codes Meeting the Johnson Bound","authors":"L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev","doi":"10.1134/s0032946024010022","DOIUrl":"https://doi.org/10.1134/s0032946024010022","url":null,"abstract":"<p>We propose several constructions of nonbinary constant-weight codes meeting the Johnson bound.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938858","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
Correcting a Single Error in an Asymmetric Feedback Channel 纠正非对称反馈信道中的单一错误
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s0032946024010034
I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev
{"title":"Correcting a Single Error in an Asymmetric Feedback Channel","authors":"I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev","doi":"10.1134/s0032946024010034","DOIUrl":"https://doi.org/10.1134/s0032946024010034","url":null,"abstract":"<p>We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938817","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
Computation of the Fundamental Limits of Data Compression for Certain Nonstationary ARMA Vector Sources 计算某些非平稳 ARMA 向量源的数据压缩基本极限
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s0032946024010010
J. Gutiérrez-Gutiérrez, Í. Barasoain-Echepare, M. Zárraga-Rodríguez, X. Insausti
{"title":"Computation of the Fundamental Limits of Data Compression for Certain Nonstationary ARMA Vector Sources","authors":"J. Gutiérrez-Gutiérrez, Í. Barasoain-Echepare, M. Zárraga-Rodríguez, X. Insausti","doi":"10.1134/s0032946024010010","DOIUrl":"https://doi.org/10.1134/s0032946024010010","url":null,"abstract":"<p>In the present article, the differential entropy rate and the rate distortion function (RDF) are computed for certain nonstationary real Gaussian autoregressive moving average (ARMA) vector sources.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938855","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 Measuring the Topological Charge of Anyons 论测量安子的拓扑电荷
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s0032946024010046
A. A. Morozov
{"title":"On Measuring the Topological Charge of Anyons","authors":"A. A. Morozov","doi":"10.1134/s0032946024010046","DOIUrl":"https://doi.org/10.1134/s0032946024010046","url":null,"abstract":"<p>We discuss principles of measuring a topological charge or representation that travels in a set of anyons. We describe the procedure and analyze how it works for different values of theory parameters. We also show how it can be modified to be more efficient.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938856","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
Elementary Solution to the Fair Division Problem 公平除法问题的初级解决方案
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-08-07 DOI: 10.1134/s003294602401006x
M. L. Blank, M. O. Polyakov
{"title":"Elementary Solution to the Fair Division Problem","authors":"M. L. Blank, M. O. Polyakov","doi":"10.1134/s003294602401006x","DOIUrl":"https://doi.org/10.1134/s003294602401006x","url":null,"abstract":"<p>A new and relatively elementary approach is proposed for solving the problem of fair division of a continuous resource (measurable space, pie, etc.) between several participants, the selection criteria of which are described by charges (signed measures). The setting of the problem with charges is considered for the first time. The problem comes down to analyzing properties of trajectories of a specially constructed dynamical system acting in the space of finite measurable partitions. Exponentially fast convergence to a limit solution is proved for both the case of true measures and the case of charges.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141938857","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
Time Synchronization in Satellite Quantum Key Distribution 卫星量子密钥分发中的时间同步
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-03-26 DOI: 10.1134/s0032946023040026
A. V. Miller
{"title":"Time Synchronization in Satellite Quantum Key Distribution","authors":"A. V. Miller","doi":"10.1134/s0032946023040026","DOIUrl":"https://doi.org/10.1134/s0032946023040026","url":null,"abstract":"<p>Time synchronization is one of the most crucial issues that must be addressed in developing quantum key distribution (QKD) systems. It not only lets the transmitter and the receiver to assign a sequence number to each event and then do correct basis reconciliation, but also allows to increase signal-to-noise ratio. Time synchronization in satellite communications is especially complicated due to such factors as high loss, signal fading, and Doppler effect. In this work, a simple, efficient, and robust algorithm for time synchronization is proposed. It was tested during experiments on QKD between Micius, the world’s first quantum communications satellite, and an optical ground station located in Russia. The obtained synchronization precision lies in the range from 467 to 497 ps. The authors compare their algorithm for time synchronization with the previously used methods. The proposed approach can also be applied to terrestrial QKD systems.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140312613","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 the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals 论覆盖半径为 2 和对偶的完全正则码的分类
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-03-26 DOI: 10.1134/s003294602303002x
J. Borges, V. A. Zinoviev, D. V. Zinoviev
{"title":"On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals","authors":"J. Borges, V. A. Zinoviev, D. V. Zinoviev","doi":"10.1134/s003294602303002x","DOIUrl":"https://doi.org/10.1134/s003294602303002x","url":null,"abstract":"<p>We classify all linear completely regular codes which have covering radius <span>(rho=2)</span> and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes with weights <span>(d)</span> and <span>(n)</span>.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140312830","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
Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution 基于均匀分布重要度采样的有效误差下限估计
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2024-03-26 DOI: 10.1134/s0032946023040014
A. Yu. Uglovskii, I. A. Melnikov, I. A. Alexeev, A. A. Kureev
{"title":"Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution","authors":"A. Yu. Uglovskii, I. A. Melnikov, I. A. Alexeev, A. A. Kureev","doi":"10.1134/s0032946023040014","DOIUrl":"https://doi.org/10.1134/s0032946023040014","url":null,"abstract":"<p>A key problem of low-density parity-check (LDPC) codes analysis is estimation of an extremely low error floor that occurs at a high level of the signal-to-noise ratio (SNR). The importance sampling (IS) method is a popular approach to address this problem. Existing works typically use a normal sampling probability density function (PDF) with shifted mean, which yields a large variance of the estimate. In contrast, uniform distribution has equally probable samples on the entire range and thus should reduce the variance, but results in a biased estimation. This paper proposes a modified IS approach (IS-U) that allows considering the uniform distribution as a sampling PDF, and shows that this estimation is better than the traditional one. Also, this paper demonstrates that the existing criteria cannot be applied to evaluate the accuracy of the IS-U on the whole SNR range. To address this issue, a new metric is proposed, which uses only the convergence rate and does not depend on the true data.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140316842","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
Constructions and Invariants of Optimal Codes in the Lee Metric 李公设中最优编码的构造和不变式
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020011
I. Yu. Mogilnykh, F. I. Solov’eva
{"title":"Constructions and Invariants of Optimal Codes in the Lee Metric","authors":"I. Yu. Mogilnykh, F. I. Solov’eva","doi":"10.1134/s0032946023020011","DOIUrl":"https://doi.org/10.1134/s0032946023020011","url":null,"abstract":"<p>We propose concatenation and switching methods for the construction of single-error-correcting perfect and diameter codes in the Lee metric. We analyze ranks and kernels of diameter perfect codes obtained by the switching construction.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139030169","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
下一页 尾页
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学术官方微信