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

Problems of Information Transmission最新文献

筛选
英文 中文
Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective 攻击下数据传输的可行性：从孤立韧性变体的角度看问题
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020060
W. Gao, H. M. Başkonuş, C. Cattani
{"title":"Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective","authors":"W. Gao, H. M. Başkonuş, C. Cattani","doi":"10.1134/s0032946023020060","DOIUrl":"https://doi.org/10.1134/s0032946023020060","url":null,"abstract":"<p>The graph model is an appreciable tool for data transmission network, where the feasibility of data transmission in site attack circumstances can be described by fractional critical graphs, and the vulnerability of networks can be measured by isolation toughness variant. This paper considers both the stability of the network and the feasibility of data transmission when the sites are destroyed, and determines the isolated toughness variant bound for fractional <span>((a,b,n))</span>-critical graphs, where the parameter <span>(n)</span> represents the number of damaged sites at a certain moment. A counterexample proves the sharpness of the given isolated toughness variant bound. The main theoretical conclusion provides an equilibrium between performance and cost in network topology designing.</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":"139030170","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
Near-Ideal Predictors and Causal Filters for Discrete-Time Signals 离散时间信号的近似理想预测器和因果滤波器
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020035
N. G. Dokuchaev
{"title":"Near-Ideal Predictors and Causal Filters for Discrete-Time Signals","authors":"N. G. Dokuchaev","doi":"10.1134/s0032946023020035","DOIUrl":"https://doi.org/10.1134/s0032946023020035","url":null,"abstract":"<p>The paper presents linear predictors and causal filters for discrete-time signals featuring some different kinds of spectrum degeneracy. These predictors and filters are based on approximation of ideal noncausal transfer functions by causal transfer functions represented by polynomials of the Z-transform of the unit step signal.</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":"139030139","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
Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates 出生率和死亡率随州变化的接触过程的不变度量
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020059
E. A. Zhizhina, S. A. Pirogov
{"title":"Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates","authors":"E. A. Zhizhina, S. A. Pirogov","doi":"10.1134/s0032946023020059","DOIUrl":"https://doi.org/10.1134/s0032946023020059","url":null,"abstract":"<p>We consider contact processes on locally compact separable metric spaces with birth and death rates that are heterogeneous in space. We formulate conditions on the rates that ensure the existence of invariant measures of contact processes. One of the crucial conditions is the so-called critical regime condition. To prove the existence of invariant measures, we use the approach proposed in our preceding paper. We discuss in detail the multi-species contact model with a compact space of marks (species) in which both birth and death rates depend on the marks.</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":"139031813","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
Geometric Interpretation of the Entropy of Sofic Systems 索菲克系统熵的几何解释
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020047
G. D. Dvorkin
{"title":"Geometric Interpretation of the Entropy of Sofic Systems","authors":"G. D. Dvorkin","doi":"10.1134/s0032946023020047","DOIUrl":"https://doi.org/10.1134/s0032946023020047","url":null,"abstract":"<p>We consider a geometric approach to the notion of metric entropy. We justify the possibility of this approach for the class of Borel invariant ergodic probability measures on sofic systems, which is the first result of such generality for non-Markovian systems.</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":"139030104","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
Existence of Sequences Satisfying Bilinear Type Recurrence Relations 满足双线性类型递推关系的序列的存在性
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-23 DOI: 10.1134/s0032946023020072
A. A. Illarionov
{"title":"Existence of Sequences Satisfying Bilinear Type Recurrence Relations","authors":"A. A. Illarionov","doi":"10.1134/s0032946023020072","DOIUrl":"https://doi.org/10.1134/s0032946023020072","url":null,"abstract":"<p>We study sequences <span>(left{A_nright}_{n=-infty}^{+infty})</span> of elements of an arbitrary field <span>(mathbb{F})</span> that satisfy decompositions of the form\u0000</p><span>$$\u0000begin{aligned}\u0000A_{m+n} A_{m-n}&amp;=a_1(m) b_1(n)+a_2(m) b_2(n), A_{m+n+1} A_{m-n}&amp;=widetilde a_1(m)\u0000widetilde b_1(n)+widetilde a_2(m) widetilde b_2(n),\u0000end{aligned}\u0000$$</span><p>\u0000where <span>(a_1,a_2,b_1,b_2colon mathbb{Z}tomathbb{F})</span>. We prove some results concerning the existence and uniqueness of such sequences. The results are used to construct analogs of the Diffie–Hellman and ElGamal cryptographic algorithms. The discrete logarithm problem is considered in the group <span>((S,+))</span>, where the set <span>(S)</span> consists of quadruples <span>(S(n)=(A_{n-1},A_n, A_{n+1}, A_{n+2}))</span>, <span>(ninmathbb{Z})</span>, and <span>(S(n)+S(m)=S(n+m))</span>.</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":"139030177","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
Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems 电信系统中批量队列的非平凡泊松到达条件下队列长度矩公式的一般化
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-01 DOI: 10.1134/s003294602304004x
{"title":"Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems","authors":"","doi":"10.1134/s003294602304004x","DOIUrl":"https://doi.org/10.1134/s003294602304004x","url":null,"abstract":"<h3>Abstract</h3> <p>We propose an approach for generalization of formulas previously obtained by the authors for the first and second queue length moments in a queueing system with a nonordinary Poissonian arrival flow, single server, and constant service time to the case of a variable service time. The service time is assumed to be a random variable with a finite set of values. This model is adequate for a vast class of batch transmission systems, since the batch transmission time in real-world systems can take only finitely many values.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140314433","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
Half-Life and the Uncertainty Principle 半衰期和不确定性原理
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-12-01 DOI: 10.1134/s0032946023040038
{"title":"Half-Life and the Uncertainty Principle","authors":"","doi":"10.1134/s0032946023040038","DOIUrl":"https://doi.org/10.1134/s0032946023040038","url":null,"abstract":"<h3>Abstract</h3> <p>An attempt is made to give an accurate mathematical interpretation of the energy–time uncertainty relation.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140314286","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
Covering Codes for the Fixed Length Levenshtein Metric 固定长度列文士坦度量的覆盖编码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-07-01 DOI: 10.1134/s0032946023020023
{"title":"Covering Codes for the Fixed Length Levenshtein Metric","authors":"","doi":"10.1134/s0032946023020023","DOIUrl":"https://doi.org/10.1134/s0032946023020023","url":null,"abstract":"<h3>Abstract</h3> <p>A covering code, or a covering, is a set of codewords such that the union of balls centered at these codewords covers the entire space. As a rule, the problem consists in finding the minimum cardinality of a covering code. For the classical Hamming metric, the size of the smallest covering code of a fixed radius <span> <span>(R)</span> </span> is known up to a constant factor. A similar result has recently been obtained for codes with <span> <span>(R)</span> </span> insertions and for codes with <span> <span>(R)</span> </span> deletions. In the present paper we study coverings of a space for the fixed length Levenshtein metric, i.e., for <span> <span>(R)</span> </span> insertions and <span> <span>(R)</span> </span> deletions. For <span> <span>(R=1)</span> </span> and <span> <span>(2)</span> </span>, we prove new lower and upper bounds on the minimum cardinality of a covering code, which differ by a constant factor only.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139030105","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
Convolutional Codes with Optimum Bidirectional Distance Profile 具有最佳双向距离剖面的卷积码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-07-01 DOI: 10.1134/s0032946023030018
{"title":"Convolutional Codes with Optimum Bidirectional Distance Profile","authors":"","doi":"10.1134/s0032946023030018","DOIUrl":"https://doi.org/10.1134/s0032946023030018","url":null,"abstract":"<h3>Abstract</h3> <p>We define the bidirectional distance profile (BDP) of a convolutional code as the minimum of the distance profiles of the code and its corresponding “reverse” code. We present tables of codes with the optimum BDP (OBDP), which minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their “prefixes”, and that OBDP codes can be obtained by “concatenating” ODP and reverse ODP codes of smaller memory. We compare the performance of OBDP codes and other codes by simulation.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140314285","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
Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding 从不准确的线性测量中精确支持恢复稀疏向量的编码及其解码
IF 1.2 4区 计算机科学
Problems of Information Transmission Pub Date : 2023-01-01 DOI: 10.1134/S0032946023010027
Marcel Fernández, G. Kabatiansky, S. A. Kruglik, Ying Miao
{"title":"Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding","authors":"Marcel Fernández, G. Kabatiansky, S. A. Kruglik, Ying Miao","doi":"10.1134/S0032946023010027","DOIUrl":"https://doi.org/10.1134/S0032946023010027","url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47557381","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学术官方微信