Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

12 Publications


2024 | Journal Article | IST-REx-ID: 15172
Concentration without independence via information measures
A.R. Esposito, M. Mondelli, IEEE Transactions on Information Theory (n.d.).
View | Files available | DOI | arXiv
 

2023 | Journal Article | IST-REx-ID: 12838 | OA
Multiple packing: Lower bounds via infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 69 (2023) 4513–4527.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Journal Article | IST-REx-ID: 14665 | OA
Multiple packing: Lower bounds via error exponents
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory (2023).
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 14751 | OA
Zero-error communication over adversarial MACs
Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 13269 | OA
Codes for the Z-channel
N. Polyanskii, Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 6340–6357.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 10775 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 11639 | OA
List decoding random Euclidean codes and Infinite constellations
Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 68 (2022) 7753–7786.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 12273 | OA
Quadratically constrained myopic adversarial channels
Y. Zhang, S. Vatedka, S. Jaggi, A.D. Sarwate, IEEE Transactions on Information Theory 68 (2022) 4901–4948.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9002
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.
[Preprint] View | Files available | DOI | arXiv
 

2018 | Journal Article | IST-REx-ID: 6678 | OA
How to achieve the capacity of asymmetric channels
M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 6730 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Journal Article | IST-REx-ID: 6732 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

issn=0018-9448

Search

Filter Publications