IEEE Transactions on Information Theory最新文献

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3575557","DOIUrl":"https://doi.org/10.1109/TIT.2025.3575557","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11045270","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331807","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 Information for Authors","authors":"","doi":"10.1109/TIT.2025.3575559","DOIUrl":"https://doi.org/10.1109/TIT.2025.3575559","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11045267","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144323153","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":"Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels","authors":"Rami Ezzine;Moritz Wiese;Christian Deppe;Holger Boche","doi":"10.1109/TIT.2025.3565891","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565891","url":null,"abstract":"We consider a standard two-source model for uniform common randomness (UCR) generation, in which two terminals (Terminal <italic>A</i> and Terminal <italic>B</i>) observe independent and identically distributed (i.i.d.) samples of a correlated finite source, and where Terminal <italic>A</i> is allowed to send information to Terminal <italic>B</i> over an arbitrary single-user channel. We provide a general theoretical framework, from which the proofs of a general formula for the UCR capacity and general bounds on the <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>-UCR capacity of the specified model follow as special cases. The UCR capacity is defined as the maximum achievable CR rate such that the two terminals can agree on a common uniform or nearly uniform random variable with probability arbitrarily close to one, whereas the <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>-UCR capacity is defined as the maximum CR rate that can be achieved such that the probability that the two terminals do not agree on a common uniform or nearly uniform random variable does not exceed <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>, where <inline-formula> <tex-math>$0 lt epsilon lt 1$ </tex-math></inline-formula> is fixed. The established general formula for the UCR capacity depends on a formula characterizing the transmission capacity of arbitrary point-to-point channels, as elaborated by Verdú and Han. The derived general lower and upper bounds on the <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>-UCR capacity depend on corresponding lower and upper bounds on the <inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>-transmission capacity, as proved by Verdú and Han for arbitrary point-to-point channels. Since we are considering general channels, the derived bounds are equal except possibly for at most countably many points, where discontinuity issues might arise. We further provide two examples of channels for which the established bounds are equal and investigate the left-continuity and monotonicity of the derived lower bound.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5312-5329"},"PeriodicalIF":2.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331671","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":"Constructions of Self-Orthogonal Linear Codes and Dual-Containing BCH Codes","authors":"Conghui Xie;Hao Chen;Chengju Li;Sihem Mesnager","doi":"10.1109/TIT.2025.3565708","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565708","url":null,"abstract":"Self-orthogonal and dual-containing codes are two important subclasses of linear codes in coding theory and have been studied for many years. In this paper, we present several sufficient conditions for self-orthogonal or dual-containing codes when a linear code, cyclic code or BCH code <inline-formula> <tex-math>$mathcal {C}$ </tex-math></inline-formula> is transformed to an equivalent code <inline-formula> <tex-math>${mathbf { v}} cdot {mathcal {C}}$ </tex-math></inline-formula>. Specifically, we prove that linear codes are equivalent to Euclidean or Hermitian self-orthogonal codes if the dimension is very small. For primitive BCH codes, we prove that when designed distances are small, equivalent Euclidean dual-containing codes always exist. From our method presented in this paper, many self-orthogonal or dual-containing linear, cyclic or BCH codes with good parameters can be constructed explicitly. We also construct some Euclidean dual-containing binary BCH codes with best-known parameters.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5049-5062"},"PeriodicalIF":2.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331504","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":"Codes for Limited-Magnitude Probability Error in DNA Storage","authors":"Wenkai Zhang;Zhiying Wang","doi":"10.1109/TIT.2025.3565662","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565662","url":null,"abstract":"DNA, with remarkable properties of high density, durability, and replicability, is one of the most appealing storage media. Emerging DNA storage technologies use composite DNA letters, where information is represented by probability vectors, leading to higher information density and lower synthesizing costs than regular DNA letters. However, it faces the problem of inevitable noise and information corruption. This paper explores the channel of composite DNA letters in DNA-based storage systems and introduces block codes for limited-magnitude probability errors on probability vectors. First, outer and inner bounds for limited-magnitude probability error correction codes are provided. Moreover, code constructions are proposed where the number of errors is bounded by <italic>t</i>, the error magnitudes are bounded by <italic>l</i>, and the probability resolution is fixed as <italic>k</i>. These constructions focus on leveraging the properties of limited-magnitude probability errors in DNA-based storage systems, leading to improved performance in terms of complexity and redundancy. In addition, the asymptotic optimality for one of the proposed constructions is established. Finally, systematic codes based on one of the proposed constructions are presented, which enable efficient information extraction for practical implementation.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5063-5081"},"PeriodicalIF":2.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331505","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":"Robust Sequential Change Detection: The Approach Based on Breakdown Points and Influence Functions","authors":"Ruizhi Zhang","doi":"10.1109/TIT.2025.3565748","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565748","url":null,"abstract":"Sequential change-point detection has many important applications in industrial quality control, signal detection, and clinical trials. However, many classical procedures may fail when the observed data are contaminated by outliers, even if the percentage of outliers is very small. In this paper, we focus on the problem of robust sequential change-point detection in the presence of a small proportion of random outliers. We first study the statistical detection properties of a general family of detection procedures under Huber’s gross error model. Moreover, we incorporate ideas of the breakdown point and the influence function from the classical offline robust statistics literature and propose their new definitions to quantify the robustness of general sequential change-point detection procedures. Then, we derive the breakdown points and influence functions of our proposed family of detection procedures, which provide a quantitative analysis of the robustness of these procedures. Moreover, we find the optimal robust bounded-influence procedure in that general family that has the smallest detection delay subject to the constraints on the false alarm rate influence function. It turns out the optimal procedure is based on truncation of the scaled likelihood ratio statistic and has a simple form. Finally, we demonstrate the robustness and the detection efficiency of the optimal robust bounded-influence procedure through extensive simulations and compute numerical approximations of breakdown points and influence functions of some procedures to have a quantitative understanding of the robustness of different procedures.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5620-5632"},"PeriodicalIF":2.2,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331547","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":"Explicit Constructions of Capacity-Achieving T-PIR Schemes Over Small Fields via Generalized Minor Matrices","authors":"Jingke Xu;Weijun Fang","doi":"10.1109/TIT.2025.3565288","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565288","url":null,"abstract":"Suppose a distributed storage system containing <italic>M</i> files is replicated across <italic>N</i> servers, and a user wants to privately retrieve one file by accessing the servers such that the identity of the retrieved file is kept secret from any subset of up to <italic>T</i> servers, where each file can be viewed as a vector over the <italic>q</i>-ary finite field <inline-formula> <tex-math>$mathbb {F}_{q}$ </tex-math></inline-formula>. A scheme designed for this purpose is called a <italic>T</i>-private information retrieval (<italic>T</i>-PIR) scheme. We consider the problem of explicitly constructing capacity-achieving <italic>T</i>-PIR schemes over small finite fields. In this paper, we first provide a general framework for constructing explicit capacity-achieving <italic>T</i>-PIR schemes for all parameters, which only relies on an MDS array matrix with a special information set. To construct such an MDS array matrix, we propose a new family of matrices over finite fields, called the generalized minor matrices of the Moore matrix, and establish a series of key identities. By combining favourable properties of generalized minor matrices with our framework, we construct an explicit capacity-achieving <italic>T</i>-PIR scheme with optimal sub-packetization over the field <inline-formula> <tex-math>$mathbb {F}_{q}$ </tex-math></inline-formula>, as small as possible, for three classes of parameters <inline-formula> <tex-math>$N,T,Mgeq 3$ </tex-math></inline-formula>. Specifically, the first class of construction works for all <inline-formula> <tex-math>$N=d(2t-1), T=dt$ </tex-math></inline-formula>, and the field size <italic>q</i> is the least prime power satisfying <inline-formula> <tex-math>$q^{t-1}geq N$ </tex-math></inline-formula>. Moreover, this construction generalizes the scheme proposed by Xu and Wang in 2022, which only considers the case of <inline-formula> <tex-math>$N=d(2t-1), T=dt$ </tex-math></inline-formula> with <inline-formula> <tex-math>$2^{t-1}geq N$ </tex-math></inline-formula>. For all <inline-formula> <tex-math>$N=d(2t+1), T=dt$ </tex-math></inline-formula>, our second <italic>T</i>-PIR scheme is the first explicit construction, and the field size <italic>q</i> is the least prime power satisfying <inline-formula> <tex-math>$q^{t} geq N$ </tex-math></inline-formula>, which is the smallest field size among all known explicit capacity-achieving <italic>T</i>-PIR schemes. Particularly, when <inline-formula> <tex-math>$2^{t}geq N$ </tex-math></inline-formula>, the field size of such constructions can be reduced to 2. In the case of <inline-formula> <tex-math>$N=4s$ </tex-math></inline-formula> and <inline-formula> <tex-math>$T=2s+1$ </tex-math></inline-formula>, our scheme is the first one to reduce the field size to <inline-formula> <tex-math>$q=2$ </tex-math></inline-formula>. Compared with all known explicitly capacity-achieving <italic>T</i>-PIR schemes, the required field of our schemes has the smallest size.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5109-5129"},"PeriodicalIF":2.2,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331544","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":"A Locality-Based Lens for Coded Computation","authors":"Michael Rudow;K. V. Rashmi;Venkatesan Guruswami","doi":"10.1109/TIT.2025.3565558","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565558","url":null,"abstract":"Coded computation is an emerging paradigm of applying coding theory to large-scale distributed computing to provide resilience against slow or otherwise unavailable workers. We propose a new approach to view coded computation via the lens of the locality of codes. We do so by defining a new notion of locality, called <italic>computational locality</i>, using the locality properties of an appropriately defined code for the function being computed. This notion of locality incorporates the unique aspects of locality arising in the context of coded computation. Our first major contribution is to demonstrate how to design a coded computation scheme for a function using the local recovery scheme of an appropriately defined code. The so-obtained scheme rederives the best known coded computation scheme for multivariate polynomial functions via the viewpoint of the locality of the Reed-Muller code. Our second major contribution is to show that the proposed locality-based approach enables new tradeoffs (e.g., communication bandwidth vs number of workers) compared to existing coded computation schemes. Specifically for the case when there is known linear dependence among inputs—common in many real-world applications—the proposed approach significantly reduces resource overhead (i.e., number of workers) without incurring any tradeoffs.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5684-5699"},"PeriodicalIF":2.2,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331670","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":"Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks","authors":"Sudong Ma;Chenhui Jin;Xinxin Gong;Senpeng Wang;Ting Cui;Lin Ding;Jie Guan","doi":"10.1109/TIT.2025.3565463","DOIUrl":"https://doi.org/10.1109/TIT.2025.3565463","url":null,"abstract":"Fast correlation attack is one of the most powerful attack methods for LFSR-based stream ciphers, and the primary problem of the attack is to construct the linear approximations with great absolute correlations. For some stream ciphers with complex structures of linear approximations, the search for the maximum absolute correlation of linear approximations has always been a difficult problem because of the extremely high amount of masks that need to be searched. In this paper, an analysis method for searching maximum absolute correlation based on the linear mask structure is developed, including the filtering technology based on mask propagation trail, a structural characteristic of linear approximations of linear transformations with fewer active bytes, and linear approximation equivalence theorem of composite function composed of the parallel identical S-boxes and linear transformation. These methods efficiently reduce the exhaustive time complexity of the masks. As applications, this paper proves that the suprema of absolute correlations of all the linear approximations for the five XOR-versions of SNOW family stream ciphers (i.e., SNOW &lt;inline-formula&gt; &lt;tex-math&gt;$2.0_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, SNOW &lt;inline-formula&gt; &lt;tex-math&gt;$text{3G}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{V}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{Vi}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, SNOW &lt;inline-formula&gt; &lt;tex-math&gt;$text{5G}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;) are &lt;inline-formula&gt; &lt;tex-math&gt;${2^{ - 9}}/{2^{ - 15.893}}/{2^{ - 37.964}}/{2^{ - 37.964}}/{2^{ - 37.964}}$ &lt;/tex-math&gt;&lt;/inline-formula&gt;. The exhaustive time complexity of the masks can be reduced from &lt;inline-formula&gt; &lt;tex-math&gt;$O({2^{32}})/O({2^{96}})/O({2^{384}})/O({2^{384}})/O({2^{384}})$ &lt;/tex-math&gt;&lt;/inline-formula&gt; to &lt;inline-formula&gt; &lt;tex-math&gt;$O({2^{24}})/O({2^{31.98}})/O({2^{39.98}})/O({2^{39.98}})/~O({2^{39.98}})$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, respectively. Furthermore, we give the provable security evaluations of the five ciphers against fast correlation attacks under the success probability of 0.99 for the known fast correlation attack method. For SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{V}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;/SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{Vi}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;/SNOW &lt;inline-formula&gt; &lt;tex-math&gt;$text{5G}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;, the time/data/memory complexity of the optimal fast correlation attacks are all &lt;inline-formula&gt; &lt;tex-math&gt;$O(2^{227.54})/O(2^{227.72})/O(2^{227.72})$ &lt;/tex-math&gt;&lt;/inline-formula&gt;. The results show that SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{V}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;/SNOW-&lt;inline-formula&gt; &lt;tex-math&gt;$text{Vi}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt;/SNOW &lt;inline-formula&gt; &lt;tex-math&gt;$text{5G}_{oplus }$ &lt;/tex-math&gt;&lt;/inline-formula&gt; cannot guarantee the claimed 256-bit key security for the known fast correlation attack","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4035-4054"},"PeriodicalIF":2.2,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117152","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":"Errata to “Channel Coding With Mean and Variance Cost Constraints”","authors":"Adeel Mahmood;Aaron B. Wagner","doi":"10.1109/TIT.2025.3547657","DOIUrl":"https://doi.org/10.1109/TIT.2025.3547657","url":null,"abstract":"Presents corrections to the paper, (Errata to “Channel Coding With Mean and Variance Cost Constraints”).","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"4032-4032"},"PeriodicalIF":2.2,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10975793","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870980","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}