Concentration without independence via information measures
A.R. Esposito, M. Mondelli, IEEE Transactions on Information Theory (n.d.).
LibreCat: https://research-explorer.ista.ac.at/record/15172
DOI: 10.1109/TIT.2024.3367767
arXiv: 2303.07245

Multiple packing: Lower bounds via infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 69 (2023) 4513–4527.
LibreCat: https://research-explorer.ista.ac.at/record/12838
DOI: 10.1109/TIT.2023.3260950
WoS: 001017307000023
arXiv: 2211.04407

Multiple packing: Lower bounds via error exponents
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory (2023).
LibreCat: https://research-explorer.ista.ac.at/record/14665
DOI: 10.1109/TIT.2023.3334032
arXiv: 2211.04408

Zero-error communication over adversarial MACs
Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.
LibreCat: https://research-explorer.ista.ac.at/record/14751
DOI: 10.1109/tit.2023.3257239
arXiv: 2101.12426

Codes for the Z-channel
N. Polyanskii, Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 6340–6357.
LibreCat: https://research-explorer.ista.ac.at/record/13269
DOI: 10.1109/TIT.2023.3292219
WoS: 001069680100011
arXiv: 2105.01427

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.
LibreCat: https://research-explorer.ista.ac.at/record/10775
DOI: 10.1109/TIT.2022.3148779
WoS: 000799622500022
arXiv: 2012.10584

List decoding random Euclidean codes and Infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 68 (2022) 7753–7786.
LibreCat: https://research-explorer.ista.ac.at/record/11639
DOI: 10.1109/TIT.2022.3189542
WoS: 000891796100007
arXiv: 1901.03790

Quadratically constrained myopic adversarial channels
Y. Zhang, S. Vatedka, S. Jaggi, A.D. Sarwate, IEEE Transactions on Information Theory 68 (2022) 4901–4948.
LibreCat: https://research-explorer.ista.ac.at/record/12273
DOI: 10.1109/tit.2022.3167554
WoS: 000838527100004
arXiv: 1801.05951

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.
LibreCat: https://research-explorer.ista.ac.at/record/9002
DOI: 10.1109/TIT.2020.3038806
arXiv: 1711.01339

How to achieve the capacity of asymmetric channels
M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.
LibreCat: https://research-explorer.ista.ac.at/record/6678
DOI: 10.1109/tit.2018.2789885
arXiv: 1406.7373

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.
LibreCat: https://research-explorer.ista.ac.at/record/6730
DOI: 10.1109/tit.2017.2673829
arXiv: 1601.04689

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.
LibreCat: https://research-explorer.ista.ac.at/record/6732
DOI: 10.1109/tit.2016.2616117
arXiv: 1501.02444