IEEE Transactions on Information Theory最新文献

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3605036","DOIUrl":"https://doi.org/10.1109/TIT.2025.3605036","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"C2-C2"},"PeriodicalIF":2.9,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11175291","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110289","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.3605038","DOIUrl":"https://doi.org/10.1109/TIT.2025.3605038","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"C3-C3"},"PeriodicalIF":2.9,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11175292","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110334","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":"Performance Analysis of Joint Antenna Selection and Precoding Methods in Multi-User Massive MISO","authors":"Xiuxiu Ma;Abla Kammoun;Mohamed-Slim Alouini;Tareq Y. Al-Naffouri","doi":"10.1109/TIT.2025.3602119","DOIUrl":"https://doi.org/10.1109/TIT.2025.3602119","url":null,"abstract":"This paper presents a performance analysis of two distinct techniques for antenna selection and precoding in downlink multi-user massive multiple-input single-output systems with limited dynamic range power amplifiers. Both techniques are derived from the original formulation of the regularized-zero forcing precoder, designed as the solution to minimizing a regularized distortion. Based on this, the first technique, called the <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm precoder, adopts an <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm regularization term to encourage sparse solutions, thereby enabling antenna selection. The second technique, termed the thresholded <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm precoder, involves post-processing the precoder solution obtained from the first method by applying an entry-wise thresholding operation. This work conducts a precise performance analysis to compare these two techniques. The analysis leverages the Gaussian min-max theorem which is effective for examining the asymptotic behavior of optimization problems without explicit solutions. While the analysis of the <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm precoder follows from the conventional convex Gaussian min-max theorem framework, understanding the thresholded <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm precoder is more complex due to the non-linear behavior introduced by the thresholding operation. To address this complexity, we develop a novel Gaussian min-max theorem tailored to these scenarios. We provide precise asymptotic behavior analysis of the precoders, focusing on metrics such as received signal-to-noise and distortion ratio and bit error rate. Our analysis demonstrates that the thresholded <inline-formula> <tex-math>$ell _{1}$ </tex-math></inline-formula>-norm precoder can offer superior performance when the threshold parameter is carefully selected. Simulations confirm that the asymptotic results are accurate for systems equipped with hundreds of antennas at the base station, serving dozens of user terminals.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"8099-8148"},"PeriodicalIF":2.9,"publicationDate":"2025-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110194","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":"Member ad suite","authors":"","doi":"10.1109/TIT.2025.3598417","DOIUrl":"https://doi.org/10.1109/TIT.2025.3598417","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"7416-7416"},"PeriodicalIF":2.9,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11134639","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144891084","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.3594587","DOIUrl":"https://doi.org/10.1109/TIT.2025.3594587","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"C2-C2"},"PeriodicalIF":2.9,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11134675","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144892348","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.3594589","DOIUrl":"https://doi.org/10.1109/TIT.2025.3594589","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"C3-C3"},"PeriodicalIF":2.9,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11134646","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144891089","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.3598529","DOIUrl":"https://doi.org/10.1109/TIT.2025.3598529","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"7417-7417"},"PeriodicalIF":2.9,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11134638","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144891164","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 Wire Cutting With Classical Communication","authors":"Lukas Brenner;Christophe Piveteau;David Sutter","doi":"10.1109/TIT.2025.3601047","DOIUrl":"https://doi.org/10.1109/TIT.2025.3601047","url":null,"abstract":"Circuit knitting is the process of partitioning large quantum circuits into smaller subcircuits such that the result of the original circuits can be deduced by only running the subcircuits. Such techniques will be crucial for near-term and early fault-tolerant quantum computers, as the limited number of qubits is likely to be a major bottleneck for demonstrating quantum advantage. One typically distinguishes between gate cuts and wire cuts when partitioning a circuit. The cost for any circuit knitting approach scales exponentially in the number of cuts. One possibility to realize a cut is via the quasiprobability simulation technique. In fact, we argue that all existing rigorous circuit knitting techniques can be understood in this framework. Furthermore, we characterize the optimal overhead for wire cuts where the subcircuits can exchange classical information or not. We show that the optimal cost for cutting <italic>n</i> wires without and with classical communication between the subcircuits scales as <inline-formula> <tex-math>$O(16^{n})$ </tex-math></inline-formula> and <inline-formula> <tex-math>$O(4^{n})$ </tex-math></inline-formula>, respectively.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7742-7752"},"PeriodicalIF":2.9,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110297","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":"Reduced Complexity Interval Passing for Sparse Signal Recovery","authors":"Salman Habib;Rémi A. Chou;Taejoon Kim","doi":"10.1109/TIT.2025.3599674","DOIUrl":"https://doi.org/10.1109/TIT.2025.3599674","url":null,"abstract":"The reconstruction of sparse signals from a limited set of measurements poses a significant challenge as it necessitates a solution to an underdetermined system of linear equations. Compressed sensing (CS) deals with sparse signal reconstruction using techniques such as linear programming (LP) and iterative message passing schemes. The interval passing algorithm (IPA) is an attractive CS approach due to its low complexity when compared to LP. In this paper, we propose a sequential IPA that is inspired by sequential belief propagation decoding of low-density-parity-check (LDPC) codes used for forward error correction in channel coding. In the sequential setting, each check node (CN) in the Tanner graph of an LDPC measurement matrix is scheduled one at a time in every iteration, as opposed to the standard “flooding” interval passing approach in which all CNs are scheduled at once per iteration. The sequential scheme offers a significantly lower message passing complexity compared to flooding IPA on average, and for some measurement matrix and signal sparsity, a complexity reduction of approximately 36% is achieved. We show both analytically and numerically that the reconstruction accuracy of the IPA is not compromised by adopting our sequential scheduling approach.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"8080-8098"},"PeriodicalIF":2.9,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110331","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":"Several New Classes of Self-Orthogonal Minimal Linear Codes Violating the Ashikhmin–Barg Condition","authors":"Wengang Jin;Kangquan Li;Longjiang Qu","doi":"10.1109/TIT.2025.3600002","DOIUrl":"https://doi.org/10.1109/TIT.2025.3600002","url":null,"abstract":"Linear codes have attracted considerable attention in coding theory and cryptography due to their significant applications in secret sharing schemes, secure two-party computation, and Galois geometries, among others. As two special subclasses of linear codes, minimal linear codes and self-orthogonal linear codes are of particular interest. Constructing linear codes that possess both minimality and self-orthogonality is very interesting. The main purpose of this paper is to construct self-orthogonal minimal linear codes that violate the Ashikhmin-Barg (AB for short) condition over the finite field <inline-formula> <tex-math>$mathbb {F}_{p}$ </tex-math></inline-formula>. First, we present several classes of self-orthogonal minimal linear codes violating the AB condition over the finite field <inline-formula> <tex-math>$mathbb {F}_{2}$ </tex-math></inline-formula> and determine their weight distributions. Next, for any odd prime <italic>p</i>, we construct two classes of self-orthogonal linear codes from <italic>p</i>-ary functions, which contain some optimal or almost optimal codes. Finally, based on plateaued functions, we construct two classes of self-orthogonal linear codes that violate the AB condition. Their weight distributions are also provided. To the best of our knowledge, this paper is the first to investigate the constructions of linear codes that violate the AB condition and satisfy self-orthogonality.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7699-7714"},"PeriodicalIF":2.9,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110247","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}