IEEE Transactions on Information Theory最新文献

{"title":"Covert Communication via Action-Dependent States","authors":"Hassan ZivariFard;Xiaodong Wang","doi":"10.1109/TIT.2025.3534067","DOIUrl":"https://doi.org/10.1109/TIT.2025.3534067","url":null,"abstract":"This paper studies covert communication over channels with Action-Dependent State Information (ADSI) when the state is available either non-causally or causally at the transmitter. Covert communication refers to reliable communication between a transmitter and a receiver while ensuring a low probability of detection by an adversary, which we refer to as “warden”. It is well known that in a point-to-point Discrete Memoryless Channel (DMC), it is possible to communicate on the order of <inline-formula> <tex-math>$sqrt {N}$ </tex-math></inline-formula> bits reliably and covertly over N channel uses while the transmitter and the receiver are required to share a secret key on the order of <inline-formula> <tex-math>$sqrt {N}$ </tex-math></inline-formula> bits. This paper studies achieving reliable and covert communication of positive rate, i.e., reliable and covert communication on the order of N bits in N channel uses, over a channel with ADSI while the transmitter has non-causal or causal access to the ADSI, and the transmitter and the receiver share a secret key of negligible rate. We derive achievable rates for both the non-causal and causal scenarios by using block-Markov encoding and secret key generation from the ADSI, which subsumes the best achievable rates for channels with random states. We also derive upper bounds, for both non-causal and causal scenarios, that meet our achievable rates for some special cases. As an application of our problem setup, we study covert communication over channels with rewrite options, which are closely related to recording covert information on memory, and show that a positive covert rate can be achieved in such channels. As a special case of our problem, we study the Additive White Gaussian Noise (AWGN) channels and provide lower and upper bounds on the covert capacity that meet when the transmitter and the receiver share a secret key of sufficient rate and when the warden’s channel is noisier than the legitimate receiver channel. As another application of our problem setup, we show that cooperation can lead to a positive covert rate in Gaussian channels. A few other examples are also worked out in detail.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3100-3128"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes","authors":"Gaojun Luo;Bocong Chen;Martianus Frederic Ezerman;San Ling","doi":"10.1109/TIT.2025.3533494","DOIUrl":"https://doi.org/10.1109/TIT.2025.3533494","url":null,"abstract":"Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1794-1802"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Generalized Regenerating Codes and Node Repair on Graphs","authors":"Adway Patra;Alexander Barg","doi":"10.1109/TIT.2025.3532625","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532625","url":null,"abstract":"We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the graph for the purpose of recovering the lost data. Compared to the standard setting, regenerating codes on graphs address two additional features. The repair information is moved across the network, and the cost of node repair is determined by the graphical distance from the helper nodes to the failed node. Accordingly, the helpers far away from the failed node may be expected to contribute less data for repair than the nodes in the neighborhood of that node. We analyze regenerating codes with nonuniform download for repair on graphs. Moreover, in the process of repair, the information moved from the helpers to the failed node may be combined through intermediate processing, reducing the repair bandwidth. We derive lower bounds for communication complexity of node repair on graphs, including repair schemes with nonuniform download and intermediate processing, and construct codes that attain these bounds. Additionally, some of the nodes may act as adversaries, introducing errors into the data moved in the network. For repair on graphs in the presence of adversarial nodes, we construct codes that support node repair and error correction in systematic nodes.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1613-1630"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Channel Coding With Mean and Variance Cost Constraints","authors":"Adeel Mahmood;Aaron B. Wagner","doi":"10.1109/TIT.2025.3533947","DOIUrl":"https://doi.org/10.1109/TIT.2025.3533947","url":null,"abstract":"We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the new cost formulation is equal to the capacity-cost function; in particular, the strong converse holds. We further characterize the optimal second-order coding rate of these cost-constrained codes; in particular, the optimal second-order coding rate is finite. We then show that the second-order coding performance is strictly improved with feedback using a new variation of timid/bold coding, significantly broadening the applicability of timid/bold coding schemes from unconstrained compound-dispersion channels to all cost-constrained channels. Equivalent results on the minimum average probability of error are also given.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1504-1532"},"PeriodicalIF":2.2,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2025.3527734","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527734","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 2","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10851796","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143361304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3527732","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527732","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 2","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10851775","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On Restless Linear Bandits","authors":"Azadeh Khaleghi","doi":"10.1109/TIT.2025.3533299","DOIUrl":"https://doi.org/10.1109/TIT.2025.3533299","url":null,"abstract":"A more general formulation of the linear bandit problem is considered to allow for dependencies over time. Specifically, it is assumed that there exists an unknown <inline-formula> <tex-math>$mathbb {R}^{d}$ </tex-math></inline-formula>-valued stationary <inline-formula> <tex-math>$varphi $ </tex-math></inline-formula>-mixing sequence of parameters <inline-formula> <tex-math>$(theta _{t}, ; t in mathbb {N})$ </tex-math></inline-formula> which gives rise to payoffs. This instance of the problem can be viewed as a generalization of both the classical linear bandits with iid noise, and the finite-armed restless bandits. In light of the well-known computational hardness of optimal policies for restless bandits, an approximation is proposed whose error is shown to be controlled by the <inline-formula> <tex-math>$varphi $ </tex-math></inline-formula>-dependence between consecutive <inline-formula> <tex-math>$theta _{t}$ </tex-math></inline-formula>. An optimistic algorithm, called LinMix-UCB, is proposed for the case where <inline-formula> <tex-math>$theta _{t}$ </tex-math></inline-formula> has an exponential mixing rate. The proposed algorithm is shown to incur a sub-linear regret of <inline-formula> <tex-math>$mathcal {O}left ({{sqrt {d nmathop {mathrm {polylog}} (n) }}}right)$ </tex-math></inline-formula> with respect to an oracle that always plays a multiple of <inline-formula> <tex-math>$mathbb {E};theta _{t}$ </tex-math></inline-formula>. The main challenge in this setting is to ensure that the exploration-exploitation strategy is robust against long-range dependencies. The proposed method relies on Berbee’s coupling lemma to carefully select near-independent samples and construct confidence ellipsoids around empirical estimates of <inline-formula> <tex-math>$mathbb {E};theta _{t}$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2982-2990"},"PeriodicalIF":2.2,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bounded-Degree Low-Rank Parity-Check Codes","authors":"Ermes Franch;Chunlei Li","doi":"10.1109/TIT.2025.3532811","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532811","url":null,"abstract":"Low-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography. In this paper we investigate a sub-family of LRPC codes, which have a parity-check matrix defined over a subspace &lt;inline-formula&gt; &lt;tex-math&gt;${mathcal {V}}_{alpha,d}=langle 1,alpha, ldots, alpha ^{d-1} rangle _{mathbb {F}_{q}}subsetneq mathbb {F}_{q^{m}} $ &lt;/tex-math&gt;&lt;/inline-formula&gt;, where &lt;inline-formula&gt; &lt;tex-math&gt;$mathbb {F}_{q^{m}}$ &lt;/tex-math&gt;&lt;/inline-formula&gt; is the finite field of &lt;inline-formula&gt; &lt;tex-math&gt;$q^{m}$ &lt;/tex-math&gt;&lt;/inline-formula&gt; elements, &lt;inline-formula&gt; &lt;tex-math&gt;$alpha in mathbb {F}_{q^{m}}$ &lt;/tex-math&gt;&lt;/inline-formula&gt; is an element not in any proper subfield of &lt;inline-formula&gt; &lt;tex-math&gt;$mathbb {F}_{q^{m}}$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, and d is a positive integer significantly smaller than m. These codes are termed bounded-degree LRPC (BD-LRPC) codes. BD-LRPC codes are the same as the standard LRPC codes of density 2 when the degree &lt;inline-formula&gt; &lt;tex-math&gt;$d=2$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, while for degree &lt;inline-formula&gt; &lt;tex-math&gt;$dgt 2$ &lt;/tex-math&gt;&lt;/inline-formula&gt; they constitute a proper subset of LRPC codes of density d. Exploiting the structure of &lt;inline-formula&gt; &lt;tex-math&gt;${mathcal {V}}_{alpha,d}$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, the BD-LRPC codes of degree d can uniquely correct errors of rank weight r when &lt;inline-formula&gt; &lt;tex-math&gt;$n-k geq r + u$ &lt;/tex-math&gt;&lt;/inline-formula&gt; for certain &lt;inline-formula&gt; &lt;tex-math&gt;$u geq 1$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, in contrast to the condition &lt;inline-formula&gt; &lt;tex-math&gt;$n-kgeq dr$ &lt;/tex-math&gt;&lt;/inline-formula&gt; required for the standard LRPC codes. This underscores the superior decoding capability of the BD-LRPC codes. Moreover, as the code length &lt;inline-formula&gt; &lt;tex-math&gt;$nrightarrow infty $ &lt;/tex-math&gt;&lt;/inline-formula&gt;, when &lt;inline-formula&gt; &lt;tex-math&gt;$n/mrightarrow 0$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, the BD-LRPC codes with a code rate of &lt;inline-formula&gt; &lt;tex-math&gt;$R=k/n$ &lt;/tex-math&gt;&lt;/inline-formula&gt; can be uniquely decodable with radius &lt;inline-formula&gt; &lt;tex-math&gt;$rho =r/n$ &lt;/tex-math&gt;&lt;/inline-formula&gt; approaching the Singleton bound &lt;inline-formula&gt; &lt;tex-math&gt;$1-R$ &lt;/tex-math&gt;&lt;/inline-formula&gt; by letting &lt;inline-formula&gt; &lt;tex-math&gt;$epsilon =u/nrightarrow 0$ &lt;/tex-math&gt;&lt;/inline-formula&gt;; and when &lt;inline-formula&gt; &lt;tex-math&gt;$n/m$ &lt;/tex-math&gt;&lt;/inline-formula&gt; is a constant, the BD-LRPC codes can have unique decoding radius &lt;inline-formula&gt; &lt;tex-math&gt;$rho = 1-R-epsilon $ &lt;/tex-math&gt;&lt;/inline-formula&gt; for a small &lt;inline-formula&gt; &lt;tex-math&gt;$epsilon $ &lt;/tex-math&gt;&lt;/inline-formula&gt;, allowing for &lt;inline-formula&gt; &lt;tex-math&gt;$rho gt (1-R)/2$ &lt;/tex-math&gt;&lt;/inline-formula&gt; with properly chosen parameters. This superior decoding capability is theoretically proved for the case &lt;inline-formula&gt; &lt;tex-math&gt;$d=2$ &lt;/tex-math&gt;&lt;/inline-formula&gt; and confirmed by experimental results for &lt;inline-formula&gt; &lt;tex-math&gt;$dgt 2$ &lt;/","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1593-1612"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Spectral Inference for High Dimensional Time Series","authors":"Chi Zhang;Danna Zhang","doi":"10.1109/TIT.2025.3532614","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532614","url":null,"abstract":"Spectral analysis plays a fundamental role in the study of time series. While there is a well-developed asymptotic theory for spectral density estimate in low-dimensional cases, a corresponding distributional theory for high-dimensional time series is still lacking. This paper aims to fill this gap by introducing a comprehensive inference theory for the spectral density estimate of high-dimensional time series with possibly nonlinear generating systems and non-Gaussian distributions. Our result is built across different dimensions and frequencies and can serve as a versatile tool for addressing various time series inference challenges. Additionally, we present two distinct resampling methods aimed at practical implementation of high-dimensional spectral inference, each accompanied by a theoretical justification of its validity.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2909-2929"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Broadcast Channels With Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability","authors":"Homa Nikbakht;Malcolm Egan;Jean-Marie Gorce;H. Vincent Poor","doi":"10.1109/TIT.2025.3532649","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532649","url":null,"abstract":"A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption fails when messages arrive rapidly and reliability constraints require that the number of channel uses exceed the time between arrivals. In this paper, we consider a broadcast setting in which a transmitter wishes to send two different messages to two receivers over Gaussian channels. Messages have different arrival times and decoding deadlines such that their transmission windows overlap. For this setting, we propose a coding scheme that exploits Marton’s coding strategy. We derive rigorous bounds on the achievable rate regions. Those bounds can be easily employed in point-to-point settings with one or multiple parallel channels. In the point-to-point setting with one or multiple parallel channels, the proposed achievability scheme is consistent with the normal approximation. In the broadcast setting, our scheme agrees with Marton’s strategy for sufficiently large numbers of channel uses and shows significant performance improvements over standard approaches based on time sharing for transmission of short packets.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1758-1776"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}