IEEE Transactions on Information Theory最新文献

{"title":"Fundamental Limits of Multiple-Access Integrated Sensing and Communication Systems","authors":"Yao Liu;Min Li;An Liu;Lawrence Ong;Aylin Yener","doi":"10.1109/TIT.2025.3553111","DOIUrl":"https://doi.org/10.1109/TIT.2025.3553111","url":null,"abstract":"A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state parameter sequences through echo signals. In particular, the sensing state parameters are assumed to be correlated with the channel state. In this setup, improved inner and outer bounds for capacity-distortion region are derived. The inner bound is based on an achievable scheme that combines message cooperation and joint compression of past transmitted codewords and echo signals at each transmitter, resulting in unified cooperative communication and sensing. The outer bound is based on the ideas of dependence balance for communication rate, genie-aided state estimator and rate-limited constraints on sensing distortion. The proposed inner and outer bounds are proved to improve the state-of-the-art bounds. Finally, numerical examples are provided to demonstrate that our new inner and outer bounds strictly improve the existing results.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4317-4341"},"PeriodicalIF":2.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117157","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":"Asymptotically Optimal Sequence Sets With Low/Zero Ambiguity Zone Properties","authors":"Liying Tian;Xiaoshi Song;Zilong Liu;Yubo Li","doi":"10.1109/TIT.2025.3553390","DOIUrl":"https://doi.org/10.1109/TIT.2025.3553390","url":null,"abstract":"Sequences with low/zero ambiguity zone (LAZ/ZAZ) properties are useful in modern communication and radar systems operating over mobile environments. This paper first presents a new family of ZAZ sequence sets motivated by the “modulating” zero correlation zone (ZCZ) sequences which were first proposed by Popovic and Mauritz. We then introduce a second family of ZAZ sequence sets with comb-like spectrum, whereby the local Doppler resilience is guaranteed by their inherent spectral nulls in the frequency domain. Finally, LAZ sequence sets are obtained by exploiting their connection with a novel class of mapping functions. These proposed unimodular ZAZ and LAZ sequence sets are cyclically distinct and asymptotically optimal with respect to the existing theoretical bounds on ambiguity functions.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4785-4796"},"PeriodicalIF":2.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117252","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":"Quantum Differential Privacy in the Local Model","authors":"Armando Angrisani;Elham Kashefi","doi":"10.1109/TIT.2025.3552671","DOIUrl":"https://doi.org/10.1109/TIT.2025.3552671","url":null,"abstract":"Differential privacy provides a robust framework for protecting sensitive data, while maintaining its utility for computation. In essence, a differentially private algorithm takes as input the data of multiple parties, and returns an output disclosing minimal information about any individual party. Previous research has introduced several quantum extensions of differential privacy, with applications ranging from quantum machine learning on private classical data to quantum shadow tomography. However, the local model of quantum differential privacy – where each party is responsible for privatizing their own data at a local level – has received limited attention. This work delves into locally differentially private quantum measurements. Although any measurement can be made locally differentially private by adding noise to the outcome, we demonstrate that certain quantum measurements inherently satisfy some degree of local differential privacy for specific classes of input states. This finding has two significant implications: first, limiting the analysis to classical noise injection mechanisms may lead to suboptimal privacy-utility trade-offs for quantum data; second, the theory of differential privacy can be harnessed to further investigate the capabilities of quantum measurements. Motivated by these insights, we establish strong data processing inequalities for the quantum relative entropy under local differential privacy and apply these results to asymmetric hypothesis testing of quantum states with restricted measurements. Additionally, we prove an equivalence between quantum statistical queries and quantum differential privacy in the local model, thereby addressing an open question posed by Arunachalam et al. (2021). Finally, we consider the task of quantum multi-party computation under local differential privacy, demonstrating that parity functions can be efficiently learned in this model, whereas the corresponding classical task requires exponentially many samples.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3675-3692"},"PeriodicalIF":2.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870975","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 Probably Approximately Correct Analysis of Group Testing Algorithms","authors":"Sameera Bharadwaja H.;Chandra R. Murthy","doi":"10.1109/TIT.2025.3552656","DOIUrl":"https://doi.org/10.1109/TIT.2025.3552656","url":null,"abstract":"We consider the problem of identifying the defectives from a population of items via a <italic>non-adaptive group testing</i> framework with a random pooling-matrix design. We analyze the sufficient number of tests needed for <italic>approximate set identification</i>, i.e., for identifying <italic>almost</i> all the defective and non-defective items with high <italic>confidence</i>. To this end, we view the group testing problem as a function learning problem in the probably approximately correct (PAC) framework. We derive sufficiency bounds on the number of tests for popular binary group testing recovery algorithms, namely, combinatorial orthogonal matching pursuit under Bernoulli and near-constant row-weight test designs, and definite defectives under a Bernoulli test design. We compare the derived bounds with the existing ones in the literature for exact recovery both theoretically and using simulations. Finally, we contrast the three cases under consideration in terms of the sufficient testing rate <italic>surface</i> and the sufficient number of tests <italic>contours</i> across the range of the approximation and confidence levels.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4872-4894"},"PeriodicalIF":2.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117281","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 General Method for the Development of Constrained Codes","authors":"Boris Ryabko","doi":"10.1109/TIT.2025.3552660","DOIUrl":"https://doi.org/10.1109/TIT.2025.3552660","url":null,"abstract":"Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be encoded by binary sequences containing no sub-words 00 and 111. The second class contains codes with global constraints; for example, the code-words must be binary sequences of certain even length where half of the symbols are zeros and half are ones. It is important to note that often the necessary codes must fulfill some requirements of both classes. In this paper we propose a general polynomial complexity method for constructing codes for both classes, as well as for combinations thereof. The proposed method uses the Cover enumerative code, but calculates all the parameters on the fly with polynomial complexity, unlike the known applications of that code which employ combinatorial formulae. The main idea of the paper is to use dynamic programming to perform calculations like: how many sequences with a given prefix and a given suffix length satisfying constraints exist. For the constraints under consideration, we do not need to know the entire prefix, but much less knowledge about the prefix is sufficient. That is, we only need a brief description of the prefix.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3510-3515"},"PeriodicalIF":2.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143875077","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":"Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix","authors":"Gao Huang;Song Li","doi":"10.1109/TIT.2025.3550960","DOIUrl":"https://doi.org/10.1109/TIT.2025.3550960","url":null,"abstract":"This note demonstrates that we can stably recover rank-<italic>r</i> Toeplitz matrix <inline-formula> <tex-math>$pmb {X}in mathbb {R}^{ntimes n}$ </tex-math></inline-formula> from a number of rank-one subgaussian measurements on the order of <inline-formula> <tex-math>$rlog ^{2} n$ </tex-math></inline-formula> with an exponentially decreasing failure probability by employing a nuclear norm minimization program. Our approach utilizes descent cone analysis through Mendelson’s small ball method with the Toeplitz constraint. The key ingredient is to determine the spectral norm of the random matrix of the Toeplitz structure, which may be of independent interest. This improves upon earlier analyses and resolves the conjecture in Chen et al. (IEEE Transactions on Information Theory, 61(7):4034–4059, 2015).","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3950-3956"},"PeriodicalIF":2.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870964","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":"Quantum X-Secure E-Eavesdropped T-Colluding Symmetric Private Information Retrieval","authors":"Alptug Aytekin;Mohamed Nomeir;Sajani Vithana;Sennur Ulukus","doi":"10.1109/TIT.2025.3551697","DOIUrl":"https://doi.org/10.1109/TIT.2025.3551697","url":null,"abstract":"We consider both classical and quantum variations of <italic>X</i>-secure, <italic>E</i>-eavesdropped and <italic>T</i>-colluding symmetric private information retrieval (SPIR). This is the first work to study SPIR with <italic>X</i>-security in classical or quantum variations. We first develop a scheme for classical <italic>X</i>-secure, <italic>E</i>-eavesdropped and <italic>T</i>-colluding SPIR (XSETSPIR) based on a modified version of cross subspace alignment (CSA), which achieves a rate of <inline-formula> <tex-math>$R= 1 - frac {X+max (T,E)}{N}$ </tex-math></inline-formula>. The modified scheme achieves the same rate as the scheme used for <italic>X</i>-secure PIR with the extra benefit of symmetric privacy, i.e., user-privacy as well as database-privacy. Next, we extend this scheme to its quantum counterpart based on the <italic>N</i>-sum box abstraction. This is the first work to consider the presence of eavesdroppers in quantum private information retrieval (QPIR). In the quantum variation, the eavesdroppers have better access to information over the quantum channel compared to the classical channel due to the over-the-air decodability. To that end, we develop two different schemes for quantum <italic>X</i>-secure, <italic>E</i>-eavesdropped and <italic>T</i>-colluding SPIR (QXSETSPIR) with secure over-the-air decoding. The first scheme achieves the highest possible super-dense coding gain, i.e., <inline-formula> <tex-math>$R_{Q} = min left {{{ 1, 2left ({{1-frac {X+max (T,E)}{N}}}right)}}right }$ </tex-math></inline-formula>, which requires additional uploads from the user. The second scheme on the other hand requires no extra uploads. However, it does not achieve the super-dense coding gain in some cases based on the relation between the number of eavesdropped links and the number of interference terms. The second scheme is based on the idea that there exist some special entanglement states that can be used to hide the contents of the user-required messages from the eavesdroppers using the interference symbols.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3974-3988"},"PeriodicalIF":2.2,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870962","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":"Globally-Optimal Greedy Active Sequential Estimation","authors":"Xiaoou Li;Hongru Zhao","doi":"10.1109/TIT.2025.3551621","DOIUrl":"https://doi.org/10.1109/TIT.2025.3551621","url":null,"abstract":"Motivated by modern applications such as computerized adaptive testing, sequential rank aggregation, and heterogeneous data source selection, we study the problem of active sequential estimation. The goal is to design an adaptive experiment selection rule and an estimator for more accurate parameter estimation. Greedy information-based experiment selection rules, which optimize information gain one step ahead, have been employed in practice thanks to their computational convenience, flexibility to context or task changes, and broad applicability. However, the optimality of greedy methods under a sequential decision theory framework is only established in the one-dimensional case, partly due to the problem’s combinatorial nature and the seemingly limited capacity of greedy algorithms. In this study, we close the gap for multidimensional problems. We cast the problem under a sequential decision theory framework with generalized risk measures for a large class of design-and-estimation methods. We propose adopting the maximum likelihood estimator with a class of greedy experiment selection rules. This class encompasses both existing methods and introduces new methods with improved numerical efficiency. We prove that these methods achieve asymptotic optimality when the risk measure aligns with the selection rule. Additionally, we establish that the proposed estimators are consistent and asymptotically normal, and further extend the results to allow early stopping rules. We also perform extensive numerical studies on both simulated and real data to illustrate the efficacy of the proposed methods.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3871-3924"},"PeriodicalIF":2.2,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870927","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":"Level Crossing Rate Inequalities for Product Processes and Applications to Fading Multichannels","authors":"Plínio Santini Dester;Michel Daoud Yacoub;Paulo Cardieri","doi":"10.1109/TIT.2025.3551321","DOIUrl":"https://doi.org/10.1109/TIT.2025.3551321","url":null,"abstract":"This paper presents <italic>sharp</i> inequalities for the level crossing rate of a stochastic process composed of the product of independent stochastic processes. The inequalities, which are simple to state, enlighten the contribution of each process individually. Additionally, we derive an exact formulation when the conditioned pointwise derivative of each process follows a Gaussian distribution. As application examples, the results are exercised in different scenarios using the <inline-formula> <tex-math>$alphatext{-}mu $ </tex-math></inline-formula> and <inline-formula> <tex-math>$kappatext{-}mu$ </tex-math></inline-formula> fading models, which encompass several other well-known models such as Semi-Gaussian, Rayleigh, Rice, Nakagami-<italic>m</i>, and Weibull. We provide unprecedented closed-form formulations for the level crossing rate bounds of the product of these widely-known fading processes. Notably, there are no closed forms for the level crossing rate of these products. Therefore, our bounds supply a benchmark for this metric, with one of them serving as an excellent approximation of the exact metric.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3666-3674"},"PeriodicalIF":2.2,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870966","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 MacWilliams Theorem Over Codes and Lattices","authors":"Zhiyong Zheng;Fengxia Liu;Kun Tian","doi":"10.1109/TIT.2025.3550982","DOIUrl":"https://doi.org/10.1109/TIT.2025.3550982","url":null,"abstract":"Analogies between codes and lattices have been extensively studied for the last decades. In this context, the MacWilliams identity is the finite analog of the Jacobi-Poisson summation formula of the theta function. Motivated by the random lattice theory, the statistical significance of MacWilliams theorem is considered. Indeed, the MacWilliams distribution provides a finite analog of the classical Gauss distribution. In particular, the MacWilliams distribution over quotient space of a code is statistically close to the uniform distribution. In the context of lattices, the analogy of MacWilliams identity associated with nu-function was conjectured by Solé in 1995. We give an answer to this problem.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3560-3568"},"PeriodicalIF":2.2,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143875186","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}