IEEE Transactions on Information Theory最新文献

Testing Dependency of Weighted Random Graphs 加权随机图的相关性检验

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-25 DOI: 10.1109/TIT.2026.3696669

Mor Oren-Loberman;Vered Paslev;Wasim Huleihel

引用次数: 0

Constacyclic Codes With Best-Known Parameters 具有最知名参数的恒循环码

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-27 DOI: 10.1109/TIT.2026.3697372

Zekai Chen;Min Sha

引用次数: 0

Bit-Efficient Toeplitz Covariance Estimation 位高效Toeplitz协方差估计

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-27 DOI: 10.1109/TIT.2026.3697612

Hongwei Xu;Zai Yang

引用次数: 0

IEEE Transactions on Information Theory Publication Information IEEE信息论学报，出版信息

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-06-22 DOI: 10.1109/TIT.2026.3698697

引用次数: 0

Exponents for Classical-Quantum Channel Simulation in Purified Distance 纯距离下经典量子信道模拟的指数

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-06 DOI: 10.1109/TIT.2026.3690906

Aadil Oufkir;Yongsheng Yao;Mario Berta

{"title":"Exponents for Classical-Quantum Channel Simulation in Purified Distance","authors":"Aadil Oufkir;Yongsheng Yao;Mario Berta","doi":"10.1109/TIT.2026.3690906","DOIUrl":"https://doi.org/10.1109/TIT.2026.3690906","url":null,"abstract":"We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order <inline-formula> <tex-math>$alpha in [1, infty $ </tex-math></inline-formula>), notably without the need for a critical rate — a sharp contrast to the error exponent for classical-quantum channel coding. The strong converse exponent is expressed as a single-letter formula optimized over sandwiched Rényi divergences of order <inline-formula> <tex-math>$alpha in left [{ frac {1}{2},1}right]$ </tex-math></inline-formula>. As in the classical work [Oufkir et al. (2026)], we start with the goal of asymptotically expanding the meta-converse for channel simulation in the relevant regimes. However, to deal with non-commutativity issues arising from classical-quantum channels and entanglement-assistance, we critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4537-4554"},"PeriodicalIF":2.6,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148509505","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}

引用次数: 0

The Quantum Decoding Problem: Tight Achievability Bounds and Application to Regev's Reduction 量子解码问题：紧密可达界及其在Regev约简中的应用

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-05 DOI: 10.1109/TIT.2026.3689737

Agathe Blanvillain;André Chailloux;Jean-Pierre Tillich

{"title":"The Quantum Decoding Problem: Tight Achievability Bounds and Application to Regev's Reduction","authors":"Agathe Blanvillain;André Chailloux;Jean-Pierre Tillich","doi":"10.1109/TIT.2026.3689737","DOIUrl":"https://doi.org/10.1109/TIT.2026.3689737","url":null,"abstract":"We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back to the classical decoding problem. It appears for the first time in Chen, Liu and Zhandry’s work showing a quantum advantage for the Short Integer Solution (SIS) problem for the <inline-formula> <tex-math>$l_{infty } $ </tex-math></inline-formula> norm. In a recent paper, Chailloux and Tillich proved that when we have a noise following a Bernoulli distribution, the quantum decoding problem can be solved in polynomial time and is therefore easier than classical decoding for which the best known algorithms have an exponential complexity. They also give an information theoretic limit for the code rate at which this problem can be solved which turns out to be above the Shannon limit. In this paper, we generalize the last result to all memoryless noise models. We also show similar results in the rank metric case which corresponds to a noise model which is not memoryless. We analyze the Pretty Good Measurement, from which we derive an information theoretic limit for this problem. By using the algorithm for the quantum decoding problem together with Regev’s reduction, we derive a quantum algorithm sampling codewords from the dual code according to a probability distribution which is the dual of the original noise. It turns out that at the information theoretic limit, we get the most likely nonzero codeword of the dual code. When the distribution is a decreasing function of the weight, we find minimal nonzero codewords. Note that Regev’s reduction used together with classical decoding is much less satisfying since it is not able to output those minimum weight codewords.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4980-4999"},"PeriodicalIF":2.6,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148512150","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}

引用次数: 0

Reinforcement Learning With Partial Online State Information in POMDPs: Regret Bounds and Limits pomdp中带有部分在线状态信息的强化学习：遗憾边界和限制

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-03-21 DOI: 10.1109/TIT.2026.3694700

Ming Shi;Yingbin Liang;Ness B. Shroff

{"title":"Reinforcement Learning With Partial Online State Information in POMDPs: Regret Bounds and Limits","authors":"Ming Shi;Yingbin Liang;Ness B. Shroff","doi":"10.1109/TIT.2026.3694700","DOIUrl":"https://doi.org/10.1109/TIT.2026.3694700","url":null,"abstract":"Partially observable Markov decision processes (POMDPs) are a general framework for sequential decision-making under latent state uncertainty, yet learning in POMDPs is intractable in the worst case. Motivated by sensing and probing constraints in practice, we study how much online state information (OSI) is sufficient to enable efficient learning guarantees. We formalize a model in which the learner can query only partial OSI (POSI) during interaction. We first prove an information-theoretic hardness result showing that, for general POMDPs, achieving an <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>-optimal policy can require sample complexity that is exponential unless full OSI is available. We then identify two structured subclasses that remain learnable under POSI and propose corresponding algorithms with provably efficient performance guarantees. In particular, we establish regret upper bounds with <inline-formula> <tex-math>$tilde {O}(sqrt {K})$ </tex-math></inline-formula> dependence on the number of episodes <inline-formula> <tex-math>$K$ </tex-math></inline-formula>, together with complementary lower bounds, thereby delineating when POSI suffices for efficient reinforcement learning. Our results highlight a principled separation between intractable and tractable regimes under incomplete online state access and provide new tools for jointly optimizing POSI queries and learning control actions.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4895-4925"},"PeriodicalIF":2.6,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148512265","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}

引用次数: 0

Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes 超图积和提升积码的线性时间迭代解码器

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-04-27 DOI: 10.1109/TIT.2026.3687799

Asit Kumar Pradhan;Nithin Raveendran;Narayanan Rengaswamy;Bane Vasić

{"title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","authors":"Asit Kumar Pradhan;Nithin Raveendran;Narayanan Rengaswamy;Bane Vasić","doi":"10.1109/TIT.2026.3687799","DOIUrl":"https://doi.org/10.1109/TIT.2026.3687799","url":null,"abstract":"Quantum low-density parity-check (QLDPC) codes with asymptotically non-zero rates are prominent candidates for achieving fault-tolerant quantum computation, primarily due to the low operational depth of their syndrome-measurement circuits. Numerous studies advocate the necessity of fast decoders to fully harness the capabilities of QLDPC codes, thus driving the focus towards designing low-complexity iterative decoders. However, empirical investigations indicate that such iterative decoders are susceptible to having a high error floor when decoding QLDPC codes. The main objective of this paper is to analyze the decoding failures of the <italic>hypergraph-product</i> (HGP) and <italic>lifted-product</i> (LP) codes and to design decoders that mitigate these failures, thus achieving a reduced error floor. The suboptimal performance of these codes can predominantly be ascribed to two structural phenomena: 1) stabilizer-induced trapping sets (TS), which correspond to stabilizer-induced subgraphs in the Tanner graphs; and 2) classical trapping sets (TS), which originate from the classical codes used in the construction of HGP and LP codes. The dynamics of stabilizer-induced TSs are examined, and a straightforward modification of iterative decoders is proposed to circumvent these TSs. Moreover, this work proposes a systematic methodology for designing decoders that can circumvent the classical TSs in both HGP and LP codes by deriving them from decoders capable of avoiding the TSs in the parent classical LDPC codes. When decoders that can avoid stabilizer-induced TSs are run in parallel with those that can mitigate the effect of classical TSs, the logical error rate improves significantly in the error-floor region.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4618-4647"},"PeriodicalIF":2.6,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148504454","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}

引用次数: 0

Lower Bounds on Pauli Manipulation Detection Codes 泡利操纵检测码的下界

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-04-22 DOI: 10.1109/TIT.2026.3686419

Keiya Ichikawa;Kenji Yasunaga

引用次数: 0

Recovering a Message From an Incomplete Set of Noisy Fragments 从一组不完整的噪声片段中恢复消息

IF 2.6 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2026-07-01 Epub Date: 2026-04-24 DOI: 10.1109/TIT.2026.3686745

Aditya Narayan Ravi;Alireza Vahid;Ilan Shomorony

{"title":"Recovering a Message From an Incomplete Set of Noisy Fragments","authors":"Aditya Narayan Ravi;Alireza Vahid;Ilan Shomorony","doi":"10.1109/TIT.2026.3686745","DOIUrl":"https://doi.org/10.1109/TIT.2026.3686745","url":null,"abstract":"We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of the fragments. Such a channel is motivated by applications in molecular data storage and forensics, and we refer to it as the torn-paper channel. We characterize the capacity of this channel under arbitrary i.i.d. fragment length distributions and deletion probabilities. Precisely, we show that the capacity is given by a closed-form expression that can be interpreted as <inline-formula> <tex-math>${mathrm { F}} - {mathrm { A}} $ </tex-math></inline-formula>, where F is the coverage fraction, i.e., the fraction of the input codeword that is covered by output fragments, and A is an alignment cost incurred due to the lack of ordering in the output fragments. We then consider a noisy version of the problem, where the fragments are corrupted by binary symmetric noise. We derive upper and lower bounds to the capacity, both of which can be seen as <inline-formula> <tex-math>${mathrm { F}} - {mathrm { A}} $ </tex-math></inline-formula> expressions. These bounds match for specific choices of fragment length distributions, and they are approximately tight in cases where there are not too many short fragments.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4417-4433"},"PeriodicalIF":2.6,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148509499","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}

引用次数: 0