Yihan Zhang

IEEE Trans. Inf. Theory, February, 2024

2023

Codes for the Z-Channel.

[BibT_eX]

[DOI]

Nikita Polyanskii

IEEE Trans. Inf. Theory, October, 2023

Multiple Packing:Lower Bounds via Infinite Constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

Zero-Error Communication Over Adversarial MACs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.

[BibT_eX]

[DOI]

Nicolas Resch

Chen Yuan

CoRR, 2023

Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing.

[BibT_eX]

[DOI]

CoRR, 2023

Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.

[BibT_eX]

[DOI]

Nicolas Resch

Chen Yuan

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Quadratically Constrained Myopic Adversarial Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

List Decoding Random Euclidean Codes and Infinite Constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models.

[BibT_eX]

[DOI]

Marco Mondelli

Ramji Venkataramanan

CoRR, 2022

Multiple Packing: Lower Bounds via Infinite Constellations.

[BibT_eX]

[DOI]

CoRR, 2022

Multiple Packing: Lower and Upper Bounds.

[BibT_eX]

[DOI]

CoRR, 2022

Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models.

[BibT_eX]

[DOI]

Nir Weinberger

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Lower bounds for Multiple Packing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

List-Decodability of Poisson Point Processes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Lower Bounds on List Decoding Capacity using Error Exponents.

[BibT_eX]

[DOI]

Mohammadreza Alimohammadi

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Capacity of Causal Adversarial Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

New Results on AVCs with Omniscient and Myopic Adversaries.

[BibT_eX]

[DOI]

Anuj Kumar Yadav

Proceedings of the IEEE International Symposium on Information Theory, 2022

List-Decodable Zero-Rate Codes for the Z-Channel.

[BibT_eX]

[DOI]

Nikita Polyanskii

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Capacity of Additive AVCs with Feedback.

[BibT_eX]

[DOI]

Pranav Joshi

Amritakshya Purkayastha

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Network Coding With Myopic Adversaries.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Tight List-Sizes for Oblivious AVCs under Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Quadratically Constrained Two-way Adversarial Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Improved efficiency for covering codes matching the sphere-covering bound.

[BibT_eX]

[DOI]

Aditya Potukuchi

Proceedings of the IEEE International Symposium on Information Theory, 2020

Empirical Properties of Good Channel Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Generalized List Decoding.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Improved efficiency for explicit covering codes matching the sphere-covering bound.

[BibT_eX]

[DOI]

Aditya Potukuchi