Concentration without independence via information measures
A.R. Esposito, M. Mondelli, IEEE Transactions on Information Theory (n.d.).

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

Multiple packing: Lower bounds via error exponents
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory (2023).

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

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

List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, IEEE Transactions on Information Theory 68 (2022) 3823–3828.

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

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

Binary linear codes with optimal scaling: Polar codes with large kernels
A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, IEEE Transactions on Information Theory 67 (2021) 5693–5710.

How to achieve the capacity of asymmetric channels
M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.

Reed–Muller codes achieve capacity on erasure channels
S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, E. Sasoglu, R.L. Urbanke, IEEE Transactions on Information Theory 63 (2017) 4298–4316.

Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors
M. Mondelli, S.H. Hassani, R.L. Urbanke, IEEE Transactions on Information Theory 62 (2016) 6698–6712.