{"title":"Mutual Coupling in Holographic MIMO: Physical Modeling and Information-Theoretic Analysis","authors":"Andrea Pizzo;Angel Lozano","doi":"10.1109/JSAIT.2025.3570804","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3570804","url":null,"abstract":"This paper presents a comprehensive framework for holographic multiantenna communication, a paradigm that integrates both wide apertures and closely spaced antennas relative to the wavelength. The presented framework is physically grounded, enabling information-theoretic analyses that inherently incorporate correlation and mutual coupling among the antennas. This establishes the combined effects of correlation and coupling on the information-theoretic performance limits across SNR levels. Additionally, it reveals that, by suitably selecting the individual antenna patterns, mutual coupling can be harnessed to either reinforce or counter spatial correlations as appropriate for specific SNRs, thereby improving the performance.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"111-126"},"PeriodicalIF":0.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11006094","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantum Locally Recoverable Codes via Good Polynomials","authors":"Sandeep Sharma;Vinayak Ramkumar;Itzhak Tamo","doi":"10.1109/JSAIT.2025.3567480","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3567480","url":null,"abstract":"Locally recoverable codes (LRCs) with locality parameter r can recover any erased code symbol by accessing r other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it leads to efficient repair of failed nodes. A well-known class of optimal (classical) LRCs are subcodes of Reed-Solomon codes constructed using a special type of polynomials called good polynomials. Recently, Golowich and Guruswami initiated the study of quantum LRCs (qLRCs), which could have applications in quantum data storage systems of the future. The authors presented a qLRC construction based on good polynomials arising out of subgroups of the multiplicative group of finite fields. In this paper, we present a qLRC construction method that can employ any good polynomial. We also propose a new approach for designing good polynomials using subgroups of affine general linear groups. Golowich and Guruswami also derived a lower bound on the minimum distance of their qLRC under the restriction that <inline-formula> <tex-math>$r+1$ </tex-math></inline-formula> is prime. Using similar techniques in conjunction with the expander mixing lemma, we develop minimum distance lower bounds for our qLRCs without the <inline-formula> <tex-math>$r+1$ </tex-math></inline-formula> prime restriction.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"100-110"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maryam Rezvani;Raviraj Adve;Akram Bin Sediq;Amr El-Keyi
{"title":"Energy Efficient Wireless Communications by Harnessing Huygens’ Metasurfaces","authors":"Maryam Rezvani;Raviraj Adve;Akram Bin Sediq;Amr El-Keyi","doi":"10.1109/JSAIT.2025.3566321","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3566321","url":null,"abstract":"Ambitions for the next generation of wireless communication include high data rates, low latency, ubiquitous access, ensuring sustainability (in terms of consumption of energy and natural resources), all while maintaining a reasonable level of implementation complexity. Achieving these goals necessitates reforms in cellular networks, specifically in the physical layer and antenna design. The deployment of transmissive metasurfaces at basestations (BSs) presents an appealing solution, enabling beamforming in the radiated wave domain, minimizing the need for energy-hungry RF chains. Among various metasurface-based antenna designs, we propose using Huygens’ metasurface-based antennas (HMAs) at BSs. Huygens’ metasurfaces offer an attractive solution for antennas because, by utilizing Huygens’ equivalence principle, they allow independent control over both the amplitude and phase of the transmitted electromagnetic wave. In this paper, we investigate the fundamental limits of HMAs in wireless networks by integrating electromagnetic theory and information theory within a unified analytical framework. Specifically, we model the unique electromagnetic characteristics of HMAs and incorporate them into an information-theoretic optimization framework to determine their maximum achievable sum rate. By formulating an optimization problem that captures the impact of HMA’s hardware constraints and electromagnetic properties, we quantify the channel capacity of HMA-assisted systems. We then compare the performance of HMAs against phased arrays and other metasurface-based antennas in both rich scattering and realistic 3GPP channels, highlighting their potential in improving spectral and energy efficiency.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"85-99"},"PeriodicalIF":0.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143949157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"2024 Index IEEE Journal on Selected Areas in Information Theory Vol. 5","authors":"","doi":"10.1109/JSAIT.2025.3528825","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3528825","url":null,"abstract":"","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"5 ","pages":"702-714"},"PeriodicalIF":0.0,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10839060","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142976176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"JSAIT Issue on Information-Theoretic Methods for Trustworthy and Reliable Machine Learning","authors":"Lalitha Sankar;Oliver Kosut;Flavio Calmon;Ayfer Ozgur;Lele Wang;Ofer Shayevitz;Parastoo Sadeghi","doi":"10.1109/JSAIT.2024.3508492","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3508492","url":null,"abstract":"","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"5 ","pages":"xii-xv"},"PeriodicalIF":0.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10830758","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jun Chen;Jerry Gibson;Ioannis Kontoyiannis;Yingbin Liang;S. Sandeep Pradhan;Andreas Winter;Ram Zamir;Richard E. Blahut;Yasutada Oohama;Aaron B. Wagner;Raymond W. Yeung
{"title":"Editorial Data, Physics, and Life Through the Lens of Information Theory","authors":"Jun Chen;Jerry Gibson;Ioannis Kontoyiannis;Yingbin Liang;S. Sandeep Pradhan;Andreas Winter;Ram Zamir;Richard E. Blahut;Yasutada Oohama;Aaron B. Wagner;Raymond W. Yeung","doi":"10.1109/JSAIT.2024.3499012","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3499012","url":null,"abstract":"","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"5 ","pages":"iv-xi"},"PeriodicalIF":0.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10826512","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Board of Governors","authors":"","doi":"10.1109/JSAIT.2024.3519913","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3519913","url":null,"abstract":"","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"5 ","pages":"C2-C2"},"PeriodicalIF":0.0,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10826513","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142938012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources","authors":"Jingjing Qian;Sadaf Salehkalaibar;Jun Chen;Ashish Khisti;Wei Yu;Wuxian Shi;Yiqun Ge;Wen Tong","doi":"10.1109/JSAIT.2024.3509420","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3509420","url":null,"abstract":"This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP setting with either the Kullback-Leibler (KL) divergence or Wasserstein-2 metric as the perception loss function is examined, and it is shown that for Gaussian vector sources, jointly Gaussian reconstructions are optimal. We further demonstrate that the optimal tradeoff can be expressed as an optimization problem, which can be explicitly solved. An interesting property of the optimal solution is as follows. Without the perception constraint, the traditional reverse water-filling solution for characterizing the rate-distortion (RD) tradeoff of a Gaussian vector source states that the optimal rate allocated to each component depends on a constant, called the water level. If the variance of a specific component is below the water level, it is assigned a zero compression rate. However, with active distortion and perception constraints, we show that the optimal rates allocated to the different components are always positive. Moreover, the water levels that determine the optimal rate allocation for different components are unequal. We further treat the special case of perceptually perfect reconstruction and study its RDP function in the high-distortion and low-distortion regimes to obtain insight to the structure of the optimal solution.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2024-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143107142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantum Sensing and Communication via Non-Gaussian States","authors":"Andrea Giani;Moe Z. Win;Andrea Conti","doi":"10.1109/JSAIT.2024.3491692","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3491692","url":null,"abstract":"Quantum sensing and communication (QSC) is pivotal for developing next-generation networks with unprecedented performance. Many implementations of existing QSC systems employ Gaussian states as they can be easily realized using current technologies. However, Gaussian states lack non-classical properties necessary to unleash the full potential of QSC. This motivates the use of non-Gaussian states, which have non-classical properties beneficial for QSC. This paper establishes a theoretical foundation for QSC employing photon-varied Gaussian states (PVGSs). The PVGSs are non-Gaussian states that can be generated from Gaussian states using current technologies. First, we derive a closed-form expression for the generalized bilinear generating function of ordinary Hermite polynomials and show how it can be used to describe PVGSs. Then, we characterize PVGSs by deriving their Fock representation and their inner product. We also determine equivalence conditions for Gaussian states obtained from arbitrary permutations of rotation, displacement, and squeezing operators. Finally, we explore the use of PVGSs for QSC in several case studies.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"18-33"},"PeriodicalIF":0.0,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750411","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143570888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Source Coding for Markov Sources With Partial Memoryless Side Information at the Decoder","authors":"Yasutada Oohama","doi":"10.1109/JSAIT.2024.3496197","DOIUrl":"https://doi.org/10.1109/JSAIT.2024.3496197","url":null,"abstract":"We consider the one helper source coding problem posed and investigated by Ahlswede, Körner, and Wyner for a class of information sources with memory. For this class of information sources we give explicit inner and outer bounds of the admissible rate region. We also give a certain nontrivial class of information sources where the inner and outer bounds match.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"5 ","pages":"675-693"},"PeriodicalIF":0.0,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750312","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142880454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}