| 2025 | Non-Linear Function Computation Broadcast. | Mohammad Reza Deylam Salehi, Vijith Kumar Kizhakke Purakkal, Derya Malak |
| 2025 | On Optimal Batch Size in Coded Computing. | Swapnil Saha, Emina Soljanin, Philip Whiting |
| 2025 | A Family of Lz78-Based Universal Sequential Probability Assignments. | Naomi Sagan, Tsachy Weissman |
| 2025 | Design and Decoding of Full-Diversity Construction-D Lattices on Block-Fading Channels. | Maryam Sadeghi, Hassan Khodaiemehr, Chen Feng |
| 2025 | Latent Union Completion. | Karan Vikyath Veeranna Rupashree, Siddharth Baskar, Daniel L. Pimentel-Alarcn |
| 2025 | Construction of MOGCS with Flexible Parameters via Extended Boolean Functions. | Abhishek Roy, Smarajit Das, Sudhan Majhi |
| 2025 | Towards Weight Distribution-Aware Polar Codes. | Mohammad Rowshan, Vlad-Florin Dragoi |
| 2025 | Fundamental Limits for High-Dimensional Factor Regression Models. | Riccardo Rossetti, Galen Reeves |
| 2025 | The Quantum Identification Capacity with Entanglement Assistance. | Johannes Rosenberger, Holger Boche, Christian Deppe, Uzi Pereg |
| 2025 | Stochastic Consensus-Testing in Relay Networks. | Johannes Rosenberger, Holger Boche, Juan A. Cabrera, Christian Deppe, Frank H. P. Fitzek |
| 2025 | Removal of Small Weight Stopping Sets for Asynchronous Unsourced Multiple Access. | Frederik Ritter, Jonathan Mandelbaum, Alexander Fengler, Holger Jkel, Laurent Schmalen |
| 2025 | Deep Unfolding of Fixed-Point Based Algorithm for Weighted Sum Rate Maximization. | Jan Christian Riedel, Chee-Wei Tan, Giuseppe Caire |
| 2025 | Efficient Covering Using Reed-Solomon Codes. | Samin Riasat, Hessam Mahdavifar |
| 2025 | Tight Relations and Equivalences Between Smooth Relative Entropies. | Bartosz Regula, Ludovico Lami, Nilanjana Datta |
| 2025 | Information-Theoretic Proofs for Diffusion Sampling. | Galen Reeves, Henry D. Pfister |
| 2025 | Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. | Shiv Pratap Singh Rathore, Navin Kashyap |
| 2025 | A Balanced Tree Transformation to Reduce GRAND Queries. | Lukas Rapp, Jiewei Feng, Muriel Mdard, Ken R. Duffy |
| 2025 | Streaming Codes for Multi-Hop Relay Networks with Burst Erasures. | Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha |
| 2025 | Improving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error. | V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma |
| 2025 | An Upper Bound on the Error Probability of Rpa Decoding of Reed-Muller Codes Over the Bsc. | V Arvind Rameshwar, V. Lalitha |
| 2025 | Multi-Terminal Strong Coordination Over Noisy Channels with Encoder Cooperation. | Viswanathan Ramachandran, Tobias J. Oechtering, Mikael Skoglund |
| 2025 | Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs. | Sheida Rabeti, Mohsen Moradi, Hessam Mahdavifar |
| 2025 | Gone with the Bits: Revealing Racial Bias in Low-Rate Neural Compression for Facial Images. | Tian Qiu, Arjun Nichani, Rasta Tadayontahmasebi, Haewon Jeong |
| 2025 | On the Scaling Law Tradeoff of Integrated Sensing and Communication Networks. | Min Qiu, Ming-Chun Lee, Yu-Chih Huang, Jinhong Yuan |
| 2025 | Bivariate Linear Operator Codes. | Aaron Putterman, Vadim Zaripov |