| 2025 | Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model. | Ke Wang, Zhongyan Liu, Rengang Li, Yaqian Zhao, Yaqiang Zhang |
| 2025 | Permutation Reconstructions for Deletion Channels. | Shuche Wang, Yeow Meng Chee, Van Khu Vu |
| 2025 | Understanding the Ratio of the Partition Sum to its Bethe Approximation via Double Covers. | Pascal O. Vontobel |
| 2025 | Efficient Algorithm for Sparse Fourier Transform of Generalized q-ary Functions. | Darin Tsui, Kunal Talreja, Amirali Aghazadeh |
| 2025 | On Hierarchical Coded Caching with Offline Users. | Rashid Ummer N. T., Charul Rajput, B. Sundar Rajan |
| 2025 | Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions. | Naima Tasnim, Atefeh Gilani, Lalitha Sankar, Oliver Kosut |
| 2025 | The Labeled Coupon Collector Problem. | Andrew Tan, Oriel Limor, Daniella Bar-Lev, Ryan Gabrys, Zohar Yakhini, Paul H. Siegel |
| 2025 | A Decoder with Reinforcement Learning Feedback. | Milad Taghipour, Bane Vasic |
| 2025 | Covert Computation over Gaussian Multiple-Access Channel with Feedback. | Sheng Su, Yuhan Yang, Han Deng, Fan Cheng, Bin Dai, Liuguo Yin |
| 2025 | Resolution Limits of Non-Adaptive 20 Questions Estimation for Tracking Multiple Moving Targets. | Chunsong Sun, Lin Zhou, Jingjing Wang, Weijie Yuan, Chunxiao Jiang, Alfred O. Hero III |
| 2025 | Rate Region of Semantic-Aware Quadratic Gaussian Two-Terminal Source Coding Problem. | Haoyu Sun, Yinfei Xu, Chunguo Li, Tao Guo, Wenyi Zhang |
| 2025 | Typicality with Feedback. | Thomas Sturma, Michle A. Wigger |
| 2025 | Optimal tables for asymmetric numeral systems. | Raphael S. Steiner, Mirko De Vita, Endri Bezati |
| 2025 | Information Freshness in Dynamic Gossip Networks. | Arunabh Srivastava, Thomas Jacob Maranzatto, Sennur Ulukus |
| 2025 | On Two-Point Rational AG Codes with Lower Bounded Hermitian Hull Dimension. | Lin Sok, San Ling |
| 2025 | Grid-Like Error-Correcting Codes for Matrix Multiplication with Better Correcting Capability. | Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou |
| 2025 | A Simple Derivation of The Refined Sphere-Packing Bound for Classical-Quantum Channels. | Bo-An Shi, Hao-Chung Cheng |
| 2025 | FORTA: Byzantine-Resilient FL Aggregation via DFT-Guided Krum. | Usayd Shahul, J. Harshan |
| 2025 | On Distributionally Robust Lossy Source Coding. | Giuseppe Serra, Photios A. Stavrou, Marios Kountouris |
| 2025 | On Plotkin Bound for Function-Correcting Codes for b-Symbol Read Channels. | Sachin Sampath, B. Sundar Rajan |
| 2025 | Identification over Affine Poisson Channels: Application to Molecular Mixture Communication Systems. | Mohammad Javad Salariseddigh, Heinz Koeppl, Holger Boche, Vahid Jamali |
| 2025 | Towards a Compositional Theory of Channels that Preserve Functions. | Johannes Rosenberger, Holger Boche, Juan A. Cabrera, Christian Deppe |
| 2025 | Optimizing Privacy-Utility Trade-off in Decentralized Learning with Generalized Correlated Noise. | Angelo Rodio, Zheng Chen, Erik G. Larsson |
| 2025 | A Monoid Ring Approach to Color Visual Cryptography. | Maximilian Reif, Jens Zumbrgel |
| 2025 | An Improved Decimation Technique for Erasure Decoding of Quantum LDPC Codes. | Gayathri R., Shobhit Bhatnagar, Abhinav Vaishya, P. Vijay Kumar |