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 | 
A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11639 |
Y. Zhang and S. Vatedka, “List decoding random Euclidean codes and Infinite constellations,” IEEE Transactions on Information Theory, vol. 68, no. 12. IEEE, pp. 7753–7786, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12273 |
Y. Zhang, S. Vatedka, S. Jaggi, and A. D. Sarwate, “Quadratically constrained myopic adversarial channels,” IEEE Transactions on Information Theory, vol. 68, no. 8. Institute of Electrical and Electronics Engineers, pp. 4901–4948, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9002
A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” IEEE Transactions on Information Theory, vol. 67, no. 9. IEEE, pp. 5693–5710, 2021.
[Preprint]
View
| Files available
| DOI
| arXiv
2017 | Journal Article | IST-REx-ID: 6730 |
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke, “Reed–Muller codes achieve capacity on erasure channels,” IEEE Transactions on Information Theory, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv