IEEE Transactions on Information Theory最新文献

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2025.3539818","DOIUrl":"https://doi.org/10.1109/TIT.2025.3539818","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10896626","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455193","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":"Private Inference in Quantized Models","authors":"Zirui Deng;Vinayak Ramkumar;Rawad Bitar;Netanel Raviv","doi":"10.1109/TIT.2025.3543908","DOIUrl":"https://doi.org/10.1109/TIT.2025.3543908","url":null,"abstract":"A typical setup in many machine learning scenarios involves a server that holds a model and a user that possesses data, and the challenge is to perform inference while safeguarding the privacy of both parties. <italic>Private Inference</i> has been extensively explored in recent years, mainly from a cryptographic standpoint via techniques like homomorphic encryption and multiparty computation. These approaches often come with high computational overhead and may degrade the accuracy of the model. In our work, we take a different approach inspired by the <italic>Private Information Retrieval</i> literature. We view private inference as the task of retrieving inner products of parameter vectors with the data, a fundamental operation in many machine learning models. We introduce schemes that enable such retrieval of inner products for models with <italic>quantized</i> (i.e., restricted to a finite set) weights; such models are extensively used in practice due to a wide range of benefits. In addition, our schemes uncover a fundamental tradeoff between user and server privacy. Our information-theoretic approach is applicable to a wide range of problems and robust in privacy guarantees for both the user and the server.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3957-3973"},"PeriodicalIF":2.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870976","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":"Parallel Welch–Berlekamp Algorithm","authors":"Chao Chen;Yunghsiang S. Han;Nianqi Tang;Xiao Ma;Baoming Bai","doi":"10.1109/TIT.2025.3542812","DOIUrl":"https://doi.org/10.1109/TIT.2025.3542812","url":null,"abstract":"This paper presents new variants of the Welch-Berlekamp algorithm that are favorable to hardware implementation. First, we derive the parallel Welch-Berlekamp (PWB) algorithm in a constructive manner based on the properties of solutions to the rational interpolation problem. The algorithm features the simultaneously performed discrepancy computation and polynomial update. Second, we explore the early-termination mechanism of the PWB algorithm for decoding of Reed-Solomon (RS) codes. By introducing the concept of incomplete error locator polynomial, we show that if <inline-formula> <tex-math>$e leq t$ </tex-math></inline-formula> (where <italic>e</i> is the number of errors and <italic>t</i> is the error correction capability), the PWB algorithm can be terminated at latest at the completion of the <inline-formula> <tex-math>$(t+ e)$ </tex-math></inline-formula>-th iteration. This leads to the early-terminating PWB (EPWB) algorithm. Finally, we develop frequency-domain versions of the PWB and EPWB algorithms, namely, FPWB and FEPWB. The key point toward the two algorithms is to replace the update of polynomial coefficients with the update of polynomial evaluations. It is worth noting that the FEPWB algorithm applies only to shortened RS codes. Furthermore, an efficient systolic architecture for the FPWB algorithm is designed, which is easily adapted for the FEPWB algorithm.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3473-3488"},"PeriodicalIF":2.2,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143875248","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":"Asymptotic Capacity of 1-bit MIMO Fading Channels","authors":"Sheng Yang;Richard Combes","doi":"10.1109/TIT.2025.3543724","DOIUrl":"https://doi.org/10.1109/TIT.2025.3543724","url":null,"abstract":"In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive antennas. In the coherent case, where the channel state information (CSI) is known at the receiver’s side, we characterize the asymptotic capacity and derive the exact scaling in the extreme regimes of signal-to-noise ratio (SNR) and the number of transmit antennas. In the non-coherent case, where the CSI is unknown but remains constant during <italic>T</i> symbol periods, we first obtain the exact asymptotic capacity for <inline-formula> <tex-math>$Tle 3$ </tex-math></inline-formula>. Then, we propose a scheme involving uniform signaling in the covariance space and derive a non-asymptotic lower bound on the capacity for an arbitrary block size <italic>T</i>. Furthermore, we propose a genie-aided upper bound where the channel is revealed to the receiver. We show that the upper and lower bounds coincide when <italic>T</i> is large. In the low SNR regime, we derive the asymptotic capacity up to a vanishing term, which, remarkably, matches our capacity lower bound.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2626-2641"},"PeriodicalIF":2.2,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675965","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 Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference","authors":"Dariusz R. Kowalski;Miguel A. Mosteiro","doi":"10.1109/TIT.2025.3542767","DOIUrl":"https://doi.org/10.1109/TIT.2025.3542767","url":null,"abstract":"We study the Distributed Wireless Link Scheduling (DWLS) problem: there is a set of <italic>n</i> autonomous stations, called senders, each with a message to be delivered to some other station, called receiver. The names and locations of all stations are arbitrarily selected and unknown to each other, to mirror an arbitrary scenario that may occur in mobile communication. Each pair ((sender,receiver),message) is called a request, and the event of successfully delivering the message is called the realization of the request. In the DWLS problem, the requests are realized through wireless communication links (which is a conceptual notion of two nodes being capable of direct wireless delivery of a message) between the stations. The decision to transmit a message is made locally by each station. We consider networks where communication links may interfere with each other, where the interference is an arbitrary input function of each pair of links, customarily called affectance; if the total affectance of other links whose senders are currently transmitting is above a given threshold, the considered transmission is not successful. In the above context, we study the impact of the number of truly random bits used by each link/sender, on the length of the transmission schedules. Specifically, for any set <italic>L</i> of <italic>n</i> requests with maximum average affectance <inline-formula> <tex-math>$A(L)$ </tex-math></inline-formula>, we present a deterministic algorithm (i.e., 0 random bits) and a randomized algorithm using <inline-formula> <tex-math>$O(log A(L)log n)$ </tex-math></inline-formula> random bits per link. (In this abstract we present formulas in simplified forms, for brevity.) The lengths of their transmission schedules are <inline-formula> <tex-math>$O(A(L)^{2}log ^{3} n)$ </tex-math></inline-formula> and <inline-formula> <tex-math>$O(A(L)log n)$ </tex-math></inline-formula>, respectively. We then combine both approaches to get a randomized solution using <inline-formula> <tex-math>$O(log W log n)$ </tex-math></inline-formula> truly random bits per station with schedules of length <inline-formula> <tex-math>$Oleft ({{frac {A(L)^{2}}{W}log n}}right)$ </tex-math></inline-formula>, for any <inline-formula> <tex-math>$Wle A(L)$ </tex-math></inline-formula>. To the best of our knowledge, our study is a first step towards understanding the trade-offs between randomness and time complexity of Link Scheduling under arbitrary interference. It is particularly important as currently used (in practice) wireless protocols are either deterministic or use a very small random seed of (truly) random bits.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3157-3166"},"PeriodicalIF":2.2,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667311","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":"Byzantine-Resilient Gradient Coding Through Local Gradient Computations","authors":"Christoph Hofmeister;Luis Maßny;Eitan Yaakobi;Rawad Bitar","doi":"10.1109/TIT.2025.3542896","DOIUrl":"https://doi.org/10.1109/TIT.2025.3542896","url":null,"abstract":"We consider gradient coding in the presence of an adversary controlling so-called malicious workers trying to corrupt the computations. Previous works propose the use of MDS codes to treat the responses from malicious workers as errors and correct them using the error-correction properties of the code. This comes at the expense of increasing the replication, i.e., the number of workers <italic>each partial gradient</i> is computed by. In this work, we propose a way to reduce the replication to <inline-formula> <tex-math>$ {s} +1$ </tex-math></inline-formula> instead of <inline-formula> <tex-math>$2 {s} +1$ </tex-math></inline-formula> in the presence of <italic>s</i> malicious workers. Our method detects erroneous inputs from the malicious workers, transforming them into erasures. This comes at the expense of <italic>s</i> additional local computations at the main node and additional rounds of light communication between the main node and the workers. We define a general framework and give fundamental limits for fractional repetition data allocations. Our scheme is optimal in terms of replication and local computation and incurs a communication cost that is asymptotically, in the size of the dataset, a multiplicative factor away from the derived bound. We furthermore show how additional redundancy can be exploited to reduce the number of local computations and communication cost, or, alternatively, tolerate straggling workers.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3142-3156"},"PeriodicalIF":2.2,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10891921","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667312","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":"Quantum Ruzsa Divergence to Quantify Magic","authors":"Kaifeng Bu;Weichen Gu;Arthur Jaffe","doi":"10.1109/TIT.2025.3543276","DOIUrl":"https://doi.org/10.1109/TIT.2025.3543276","url":null,"abstract":"In this work, we investigate the behavior of quantum entropy under quantum convolution and its application in quantifying magic. We first establish an entropic, quantum central limit theorem (q-CLT), where the rate of convergence is bounded by the magic gap. We also introduce a new quantum divergence based on quantum convolution, called the quantum Ruzsa divergence, to study the stabilizer structure of quantum states. We conjecture a “convolutional strong subadditivity” inequality, which leads to the triangle inequality for the quantum Ruzsa divergence. In addition, we propose two new magic measures, the quantum Ruzsa divergence of magic and quantum-doubling constant, to quantify the amount of magic in quantum states. Finally, by using the quantum convolution, we extend the classical, inverse sumset theory to the quantum case. These results shed new insight into the study of the stabilizer and magic states in quantum information theory.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2726-2740"},"PeriodicalIF":2.2,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676131","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":"Simultaneous Computation and Communication Over MAC","authors":"Matthias Frey;Igor Bjelaković;Michael C. Gastpar;Jingge Zhu","doi":"10.1109/TIT.2025.3542673","DOIUrl":"https://doi.org/10.1109/TIT.2025.3542673","url":null,"abstract":"We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability. Analog transmitters hold sequences of analog values. Some functions of these distributed values (but not the values themselves) need to be conveyed to the receiver, subject to a fidelity criterion such as mean squared error (MSE) or a certain maximum error with given confidence. For the case in which the computed function for the analog transmitters is a sum of values in <inline-formula> <tex-math>$[-1,1]$ </tex-math></inline-formula>, we derive inner and outer bounds for the tradeoff of digital and analog rates of communication under peak and average power constraints for digital transmitters and a peak power constraint for analog transmitters. We then extend the achievability result to a class of functions that includes all linear and some non-linear functions. This extended scheme works over fading channels as long as full channel state information is available at the transmitter. The practicality of our proposed communication scheme is shown in channel simulations that use a version of the scheme based on low density parity check (LDPC) coding. We evaluate the system performance for different block lengths and Gaussian as well as non-Gaussian noise distributions.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3644-3665"},"PeriodicalIF":2.2,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870926","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":"Constructing (h, d) Cooperative MSR Codes With Sub-Packetization (d − k + h)(d − k + 1)⌈n/2⌉","authors":"Zihao Zhang;Guodong Li;Sihuang Hu","doi":"10.1109/TIT.2025.3542118","DOIUrl":"https://doi.org/10.1109/TIT.2025.3542118","url":null,"abstract":"We address the multi-node failure repair challenges for MDS array codes. Presently, two primary models are employed for multi-node repairs: the centralized model where all failed nodes are restored in a singular data center, and the cooperative model where failed nodes acquire data from auxiliary nodes and collaborate amongst themselves for the repair process. This paper focuses on the cooperative model, and we provide explicit constructions of optimal MDS array codes with <italic>d</i> helper nodes under this model. The sub-packetization level of our new codes is <inline-formula> <tex-math>$(d-k+h)(d-k+1)^{lceil n/2 rceil }$ </tex-math></inline-formula> where <italic>h</i> is the number of failed nodes, <italic>k</i> the number of information nodes, and <italic>n</i> the code length. This improves upon recent constructions by Liu et al. (IEEE Transactions on Information Theory, Vol. 69, 2023).","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2505-2516"},"PeriodicalIF":2.2,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675902","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 Covert Communication Over Classical-Quantum Channels","authors":"Michael S. Bullock;Azadeh Sheikholeslami;Mehrdad Tahmasbi;Robert C. Macdonald;Saikat Guha;Boulat A. Bash","doi":"10.1109/TIT.2025.3537970","DOIUrl":"https://doi.org/10.1109/TIT.2025.3537970","url":null,"abstract":"We investigate covert communication over general memoryless classical-quantum channels with fixed finite-size input alphabets. We show that the square root law (SRL) governs covert communication in this setting when product a of <italic>n</i> input states is used: <inline-formula> <tex-math>$L_{mathrm { SRL}}sqrt {n}+o(sqrt {n})$ </tex-math></inline-formula> covert bits (but no more) can be reliably transmitted in <italic>n</i> uses of classical-quantum channel, where <inline-formula> <tex-math>$L_{mathrm { SRL}}gt 0$ </tex-math></inline-formula> is a channel-dependent constant that we call <italic>covert capacity</i>. We also show that ensuring covertness requires <inline-formula> <tex-math>$J_{mathrm { SRL}}sqrt {n}+o(sqrt {n})$ </tex-math></inline-formula> bits secret key shared by the communicating parties prior to transmission, where <inline-formula> <tex-math>$J_{mathrm { SRL}}geq 0$ </tex-math></inline-formula> is a channel-dependent constant. We assume a quantum-powerful adversary that can perform an arbitrary joint (entangling) measurement on all <italic>n</i> channel uses. We determine the single-letter expressions for <inline-formula> <tex-math>$L_{mathrm { SRL}}$ </tex-math></inline-formula> and <inline-formula> <tex-math>$J_{mathrm { SRL}}$ </tex-math></inline-formula>, and establish conditions when <inline-formula> <tex-math>$J_{mathrm { SRL}}=0$ </tex-math></inline-formula> (i.e., no pre-shared secret key is needed). Finally, we evaluate scenarios where covert communication is not governed by the SRL.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2741-2762"},"PeriodicalIF":2.2,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676083","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}