IEEE Transactions on Information Theory最新文献

{"title":"Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes","authors":"Yongcheng Song;Jiang Zhang;Xinyi Huang;Wei Wu","doi":"10.1109/TIT.2025.3555075","DOIUrl":"https://doi.org/10.1109/TIT.2025.3555075","url":null,"abstract":"In this paper, we initiate the study of the Rank Decoding (RD) problem and Low Rank Parity Check (LRPC) codes with blockwise structure in rank-based cryptosystems. First, we introduce the blockwise errors (<inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-errors) where each error consists of <inline-formula> <tex-math>$ell $ </tex-math></inline-formula> blocks of coordinates with direct-sum supports, and define the blockwise RD (<inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD) problem as a natural generalization of the RD problem whose solutions are <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-errors (note that the RD problem is actually a special <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD problem with <inline-formula> <tex-math>$ell =1$ </tex-math></inline-formula>). We adapt the typical attacks on the RD problem to the <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD problem, and find that the blockwise structure does not ease the problem too much: the <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD problem is still exponentially hard for appropriate choices of <inline-formula> <tex-math>$ell gt 1$ </tex-math></inline-formula>. Second, we introduce the blockwise LRPC (<inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-LRPC) codes as generalizations of the LPRC codes whose parity-check matrices can be divided into <inline-formula> <tex-math>$ell $ </tex-math></inline-formula> sub-matrices with direct-sum supports, i.e., the intersection of two subspaces generated by the entries of any two sub-matrices is a null space, and investigate the decoding algorithms for <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-errors. We find that the gain of using <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-errors in decoding capacity outweighs the complexity loss in solving the <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD problem, which makes it possible to design more efficient rank-based cryptosystems with flexible choices of parameters. As an application, we show that the two rank-based cryptosystems submitted to the NIST PQC competition, namely, RQC and ROLLO, can be greatly improved by using the ideal variants of the <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-RD problem and <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>-LRPC codes. Concretely, for 128-bit security, our RQC has total public key and ciphertext sizes of 2.5 KB, which is not only about 50% more compact than the original RQC, but also smaller than the NIST Round 4 code-based submissions HQC, BIKE, and Classic McEliece.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4806-4838"},"PeriodicalIF":2.2,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117221","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":"Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach","authors":"Zeyan Zhuang;Xin Zhang;Dongfang Xu;Shenghui Song","doi":"10.1109/TIT.2025.3554593","DOIUrl":"https://doi.org/10.1109/TIT.2025.3554593","url":null,"abstract":"Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large random matrix theory, specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solutions for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4069-4111"},"PeriodicalIF":2.2,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117255","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":"Batched Nonparametric Contextual Bandits","authors":"Rong Jiang;Cong Ma","doi":"10.1109/TIT.2025.3555071","DOIUrl":"https://doi.org/10.1109/TIT.2025.3555071","url":null,"abstract":"We study nonparametric contextual bandits under batch constraints, where the expected reward for each action is modeled as a smooth function of covariates, and the policy updates are made at the end of each batch of observations. We establish a minimax regret lower bound for this setting and propose a novel batch learning algorithm that achieves the optimal regret (up to logarithmic factors). In essence, our procedure dynamically splits the covariate space into smaller bins, carefully aligning their widths with the batch size. Our theoretical results suggest that for mathematical framework of contextual bandit, a nearly constant number of policy updates can attain optimal regret in the fully online setting.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4537-4555"},"PeriodicalIF":2.2,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117103","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 Coordination Rates in Multi-User Networks","authors":"Husein Natur;Uzi Pereg","doi":"10.1109/TIT.2025.3554042","DOIUrl":"https://doi.org/10.1109/TIT.2025.3554042","url":null,"abstract":"Quantum coordination is considered in networks with classical and quantum links. We begin with networks with <italic>classical links</i>, and characterize the generation of separable and classical-quantum correlations in three primary models: 1) a two-node network with limited common randomness (CR), 2) a no-communication network, and 3) a broadcast network, which consists of a single sender and two receivers. We establish the optimal tradeoff between the classical communication and CR rates in each setting, thus characterizing the minimal resources for simulating classical-quantum correlations. Next, we consider coordination in networks with <italic>quantum links</i>. We study the following models: 1) a cascade network with limited entanglement, 2) a broadcast network, and 3) a multiple-access network with two senders and a single receiver. We establish the optimal tradeoff between quantum communication and entanglement rates in each setting, characterizing the minimal resources for entanglement coordination. The examples demonstrate that coordination of entanglement and coordination of separable correlations behave differently. At last, we show the implications of our results on nonlocal games with quantum strategies.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4428-4453"},"PeriodicalIF":2.2,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937764","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117154","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.2025.3554064","DOIUrl":"https://doi.org/10.1109/TIT.2025.3554064","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3254-3254"},"PeriodicalIF":2.2,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10938069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698252","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.3549268","DOIUrl":"https://doi.org/10.1109/TIT.2025.3549268","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10935770","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698185","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":"Member ad suite","authors":"","doi":"10.1109/TIT.2025.3554060","DOIUrl":"https://doi.org/10.1109/TIT.2025.3554060","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3252-3252"},"PeriodicalIF":2.2,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10938071","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698187","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.3549266","DOIUrl":"https://doi.org/10.1109/TIT.2025.3549266","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10935771","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698319","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.3566317","DOIUrl":"https://doi.org/10.1109/TIT.2025.3566317","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011311","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117159","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.3566193","DOIUrl":"https://doi.org/10.1109/TIT.2025.3566193","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11011313","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117106","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}