Tight bounds on list-decodable and list-recoverable zero-rate codes
N. Resch, C. Yuan, Y. Zhang, in:, 16th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.

Mean estimation in high-dimensional binary timeinhomogeneous Markov Gaussian mixture models
A. El Latif Kadry, Y. Zhang, N. Weinberger, in:, 2025 IEEE International Symposium on Information Theory Proceedings, IEEE, 2025.

Spectral estimators for structured generalized linear models via approximate message passing
Y. Zhang, H.C. Ji, R. Venkataramanan, M. Mondelli, Mathematical Statistics and Learning 8 (2025) 193–304.

Codes for adversaries: Between worst-case and average-case jamming
B.K. Dey, S. Jaggi, M. Langberg, A.D. Sarwate, Y. Zhang, Foundations and Trends in Communications and Information Theory 21 (2024) 300–588.

Multiple packing: Lower bounds via error exponents
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 70 (2024) 1008–1039.

Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
N. Resch, C. Yuan, Y. Zhang, IEEE Transactions on Information Theory 70 (2024) 6211–6238.

Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs
B.K. Dey, S. Jaggi, M. Langberg, A.D. Sarwate, Y. Zhang, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory , Institute of Electrical and Electronics Engineers, 2024, pp. 1586–1591.

Codes for the Z-channel
N. Polyanskii, Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 6340–6357.

Multiple packing: Lower bounds via infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 69 (2023) 4513–4527.

Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
N. Resch, C. Yuan, Y. Zhang, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.

Zero-error communication over adversarial MACs
Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.

List decoding random Euclidean codes and Infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 68 (2022) 7753–7786.

Mean estimation in high-dimensional binary Markov Gaussian mixture models
Y. Zhang, N. Weinberger, in:, 36th Conference on Neural Information Processing Systems, ML Research Press, 2022.

Quadratically constrained myopic adversarial channels
Y. Zhang, S. Vatedka, S. Jaggi, A.D. Sarwate, IEEE Transactions on Information Theory 68 (2022) 4901–4948.

The capacity of causal adversarial channels
Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2523–2528.

New results on AVCs with omniscient and myopic adversaries
A.K. Yadav, M. Alimohammadi, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–2540.

On the capacity of additive AVCs with feedback
P. Joshi, A. Purkayastha, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 504–509.

Lower bounds on list decoding capacity using error exponents
Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–1329.

Lower bounds for multiple packing
Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 3085–3090.

List-decodability of Poisson Point Processes
Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2559–2564.