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.
11 Publications
2022 | Journal Article | IST-REx-ID: 10775 | 
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3148779
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11639 |
Zhang, Y., & Vatedka, S. (2022). List decoding random Euclidean codes and Infinite constellations. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3189542
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12273 |
Zhang, Y., Vatedka, S., Jaggi, S., & Sarwate, A. D. (2022). Quadratically constrained myopic adversarial channels. IEEE Transactions on Information Theory. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/tit.2022.3167554
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9002
Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2021). Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2020.3038806
[Preprint]
View
| Files available
| DOI
| arXiv
2017 | Journal Article | IST-REx-ID: 6730 |
Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., & Urbanke, R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2017.2673829
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv