| 2023 | Discrete Generalised Entropy Power Inequalities for Log-Concave Random Variables. | Lampros Gavalakis |
| 2023 | On a Class of Optimal Locally Recoverable Codes with Availability. | Clifton Garrison, Giacomo Micheli, Logan Nott, Vincenzo Pallozzi Lavorante, Phillip Waitkevich |
| 2023 | Rate-limited Quantum-to-Classical Optimal Transport: A Lossy Source Coding Perspective. | Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen |
| 2023 | Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. | Teng Fu, Yuhao Liu, Jean Barbier, Marco Mondelli, Shansuo Liang, TianQi Hou |
| 2023 | Two new algorithms for error support recovery of low rank parity check codes. | Ermes Franch, Chunlei Li |
| 2023 | Adaptive Greedy Rejection Sampling. | Gergely Flamich, Lucas Theis |
| 2023 | Sequential Hypothesis Testing for Markov Chains. | Greg Fields, Tara Javidi |
| 2023 | On the Advantages of Asynchrony in the Unsourced MAC. | Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy |
| 2023 | Minimizing Moments of AoI for Both Active and Passive Users through Second-Order Analysis. | Siqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kam |
| 2023 | Reliable Throughput of Generalized Collision Channel without Synchronization. | Yijun Fan, Yanxiao Liu, Yi Chen, Shenghao Yang, Raymond W. Yeung |
| 2023 | Streaming Erasure Codes over Multicast Relayed Networks. | Gustavo Kasper Facenda, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos |
| 2023 | A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity. | Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche |
| 2023 | Concentration without Independence via Information Measures. | Amedeo Roberto Esposito, Marco Mondelli |
| 2023 | On Semi-Supervised Estimation of Distributions. | H. S. Melihcan Erol, Erixhen Sula, Lizhong Zheng |
| 2023 | Efficiently Computing Sparse Fourier Transforms of q-ary Functions. | Yigit Efe Erginbas, Justin Singh Kang, Amirali Aghazadeh, Kannan Ramchandran |
| 2023 | A Stochastic Rate-Distortion Approach to Supervised Learning Systems. | Ahmed Elshafiy, Mahmoud Namazi, Kenneth Rose |
| 2023 | The Optimal Rate of Second-Order Generalized-Covering Codes. | Dor Elimelech, Moshe Schwartz |
| 2023 | Bounds on the Essential Covering Radius of Constrained Systems. | Dor Elimelech, Tom Meyerovitch, Moshe Schwartz |
| 2023 | Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems. | Dor Elimelech, Tom Meyerovitch, Moshe Schwartz |
| 2023 | Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance. | Maximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh, Rawad Bitar |
| 2023 | Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters. | Maximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar |
| 2023 | Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. | Maximilian Egger, Serge Kas Hanna, Rawad Bitar |
| 2023 | Maximal-Capacity Discrete Memoryless Channel Identification. | Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gndz, Nir Weinberger |
| 2023 | On Sparse Regression LDPC Codes. | Jamison R. Ebert, Jean-Franois Chamberland, Krishna R. Narayanan |
| 2023 | One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility. | Arian Eamaz, Farhang Yeganegi, Deanna Needell, Mojtaba Soltanalian |