IEEE Transactions on Information Theory最新文献

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2026.3682201","DOIUrl":"https://doi.org/10.1109/TIT.2026.3682201","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 5","pages":"C3-C3"},"PeriodicalIF":2.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11493593","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147732977","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":"Optimal Non-Adaptive Group Testing With One-Sided Error Guarantees","authors":"Daniel McMorrow;Jonathan Scarlett","doi":"10.1109/TIT.2026.3675697","DOIUrl":"https://doi.org/10.1109/TIT.2026.3675697","url":null,"abstract":"The group testing problem consists of determining a sparse subset of defective items from within a larger set of items via a series of tests, where each test outcome indicates whether at least one defective item is included in the test. We study the approximate recovery setting, where the recovery criterion of the defective set is relaxed to allow some number of items (up to a certain specified threshold) to be misclassified. In particular, we consider <italic>one-sided</i> approximate recovery criteria, where we allow either only false negative or only false positive misclassifications. Under false negatives only (i.e., finding a subset of defectives), we show that there exists an algorithm matching the optimal threshold of two-sided approximate recovery, albeit with exponential runtime. Under false positives only (i.e., finding a superset of the defectives), we provide a converse bound showing that the better of two existing algorithms is optimal.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 5","pages":"3497-3517"},"PeriodicalIF":2.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147732972","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":"On the Power Spectrum of Multiparameter Fractional Brownian Motion Random Processes","authors":"Antonio Iodice","doi":"10.1109/TIT.2026.3674945","DOIUrl":"https://doi.org/10.1109/TIT.2026.3674945","url":null,"abstract":"The definition and the evaluation of the power spectral density of a multiparameter fractional Brownian motion (fBm) random process is not straightforward, because such process is not stationary and shows infinite space-averaged variance and autocorrelation function, so that the usual definition of power spectral density does not apply. Methods currently available in literature require the use of Itō integrals and fractional derivatives to show that the multiparameter fBm has a power-law spectrum. Here, the same result is obtained without resorting to such advanced concepts, but using tools familiar to information and telecommunication engineers. In particular, two methods are proposed: one is based on the property of fBm of having stationary increments, and the other is based on the observation that the fBm can be obtained as the limiting case of a random process whose power spectral density can be defined and evaluated via the usual Wiener-Khinchin theorem.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 5","pages":"3518-3524"},"PeriodicalIF":2.9,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11437537","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147732996","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.2026.3662262","DOIUrl":"https://doi.org/10.1109/TIT.2026.3662262","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"C3-C3"},"PeriodicalIF":2.9,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11400650","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216615","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":"TechRxiv: Share Your Preprint Research with the World!","authors":"","doi":"10.1109/TIT.2026.3663823","DOIUrl":"https://doi.org/10.1109/TIT.2026.3663823","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"2028-2028"},"PeriodicalIF":2.9,"publicationDate":"2026-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11400675","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216531","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 Differential and Boomerang Properties of a Class of Binomials Over Finite Fields of Odd Characteristic","authors":"Namhun Koo;Soonhak Kwon","doi":"10.1109/TIT.2026.3657603","DOIUrl":"https://doi.org/10.1109/TIT.2026.3657603","url":null,"abstract":"In this paper, we investigate the differential and boomerang properties of a class of binomial <inline-formula> <tex-math>$F_{r,u}(x) = x^{r}(1 + uchi (x))$ </tex-math></inline-formula> over the finite field <inline-formula> <tex-math>$mathbb {F}_{p^{n}}$ </tex-math></inline-formula>, where <inline-formula> <tex-math>$r = frac {p^{n}+1}{4}$ </tex-math></inline-formula>, <inline-formula> <tex-math>$p^{n} equiv 3 pmod {4}$ </tex-math></inline-formula>, and <inline-formula> <tex-math>$chi (x) = x^{frac {p^{n} -1}{2}}$ </tex-math></inline-formula> is the quadratic character in <inline-formula> <tex-math>$mathbb {F}_{p^{n}}$ </tex-math></inline-formula>. We show that <inline-formula> <tex-math>$F_{r,pm 1}$ </tex-math></inline-formula> is locally-PN with boomerang uniformity 0 when <inline-formula> <tex-math>$p^{n} equiv 3 pmod {8}$ </tex-math></inline-formula>. To the best of our knowledge, it is the second known non-PN function class with boomerang uniformity 0, and the first such example over odd characteristic fields with <inline-formula> <tex-math>$p gt 3$ </tex-math></inline-formula>. Moreover, we show that <inline-formula> <tex-math>$F_{r,pm 1}$ </tex-math></inline-formula> is locally-APN with boomerang uniformity at most 2 when <inline-formula> <tex-math>$p^{n} equiv 7 pmod {8}$ </tex-math></inline-formula>. We also provide complete classifications of the differential and boomerang spectra of <inline-formula> <tex-math>$F_{r,pm 1}$ </tex-math></inline-formula>. Furthermore, we thoroughly investigate the differential uniformity of <inline-formula> <tex-math>$F_{r,u}$ </tex-math></inline-formula> for <inline-formula> <tex-math>$uin mathbb {F}_{p^{n}}^{*} setminus {pm 1}$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"1928-1942"},"PeriodicalIF":2.9,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216662","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.2026.3651883","DOIUrl":"https://doi.org/10.1109/TIT.2026.3651883","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 2","pages":"C3-C3"},"PeriodicalIF":2.9,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11361354","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146015946","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":"Multi-Task Semantic Communications With Bounded Privacy Leakage Constraint","authors":"Amirreza Zamani;Mikael Skoglund","doi":"10.1109/TIT.2026.3654430","DOIUrl":"https://doi.org/10.1109/TIT.2026.3654430","url":null,"abstract":"We study two semantic communication problems with privacy constraints considering single-task and multi-task scenarios. In both scenarios, an encoder has access to an information source arbitrarily correlated with some latent private information. In the single-task scenario, a user has a task, and the encoder designs a message to be revealed, which is called the semantic of the information source. Due to the privacy constraints, the semantic cannot be disclosed directly, so the encoder adds noise to produce data that can be disclosed. The goal is to design the disclosed message that maximizes the utility attained by the user while satisfying a privacy constraint. In the multi-task scenario, the user has <inline-formula> <tex-math>$L$ </tex-math></inline-formula> tasks with priorities. Similarly, the encoder designs the disclosed message by adding noise to the semantic, which is optimized for the intended tasks. The goal is to design a mechanism to produce the disclosed message that maximizes the weighted sum of the utilities achieved by the user while satisfying a privacy constraint on the private data. In this work, we first consider the single-task scenario and design the added noise utilizing various methods, including the extended versions of the Functional Representation Lemma, Strong Functional Representation Lemma, and the separation technique. By designing the added noise, we obtain lower bounds with constructive proofs. We then study the multi-task scenario and derive a simple privacy mechanism design considering the source semantics. We show that in the multi-task scenario the main problem can be divided into multiple parallel single-task problems. In both scenarios, the obtained lower and upper bounds are studied considering different cases to study their tightness. We show that under some assumptions our proposed designs are optimal. We provide a few numerical experiments based on the MNIST dataset and medical applications to illustrate the designs and evaluate the bounds, considering both single and multi-task scenarios. Finally, we study an application where a semantic communication with two separate blind encoders is considered.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"1900-1927"},"PeriodicalIF":2.9,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216534","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":"Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information","authors":"Saar Tarnopolsky;Alejandro Cohen","doi":"10.1109/TIT.2026.3651210","DOIUrl":"https://doi.org/10.1109/TIT.2026.3651210","url":null,"abstract":"We introduce a novel hybrid universal network coding cryptosystem (NU-HUNCC) for non-uniform messages in the finite blocklength regime that provides Post-Quantum (PQ) security at high communication rates. Recently, hybrid cryptosystems offered PQ security by premixing the data using secure linear coding schemes and encrypting only a small portion of it. The data is assumed to be uniformly distributed, an assumption that is often challenging to enforce. Standard fixed-length lossless source coding and compression schemes guarantee a uniform output in <italic>normalized divergence</i>. Yet, this is not sufficient to guarantee security. We consider an efficient compression scheme uniform in <italic>non-normalized variational distance</i>, that by utilizing a uniform sub-linear shared seed, guarantees PQ security. Specifically, for the proposed PQ cryptosystem, first, we provide an end-to-end practical coding scheme, NU-HUNCC, for non-uniform messages. Second, we show that NU-HUNCC is information-theoretic individually secured (IS) against an eavesdropper with access to any subset of the links and provide a converse proof against such an eavesdropper. Third, we introduce a modified security definition, individual semantic security under a chosen ciphertext attack (ISS-CCA1), and show that against an all-observing eavesdropper, NU-HUNCC satisfies its conditions. Finally, we provide an analysis of NU-HUNCC’s high data rate, low computational complexity, and the negligibility of the shared seed size.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"1850-1873"},"PeriodicalIF":2.9,"publicationDate":"2026-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216526","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":"On Random Fields Associated With Analytic Wavelet Transform","authors":"Gi-Ren Liu;Yuan-Chung Sheu;Hau-Tieng Wu","doi":"10.1109/TIT.2026.3650970","DOIUrl":"https://doi.org/10.1109/TIT.2026.3650970","url":null,"abstract":"Despite the broad application of the analytic wavelet transform (AWT), a systematic statistical characterization of its magnitude and phase as inhomogeneous random fields on the time-frequency domain when the input is a random process remains underexplored. In this work, we study the magnitude and phase of the AWT as random fields on the time-frequency domain when the observed signal is a deterministic function plus additive stationary Gaussian noise. We derive their marginal and joint distributions, establish concentration inequalities that depend on the signal-to-noise ratio (SNR), and analyze their covariance structures. Based on these results, we derive an upper bound on the probability of incorrectly identifying the time-scale ridge of the clean signal, explore the regularity of scalogram contours, and study the relationship between AWT magnitude and phase. Our findings lay the groundwork for developing rigorous AWT-based algorithms in noisy environments.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 3","pages":"2005-2027"},"PeriodicalIF":2.9,"publicationDate":"2026-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146216612","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}