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 MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 2022;68(6):3823-3828. doi: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. List decoding random Euclidean codes and Infinite constellations. IEEE Transactions on Information Theory. 2022;68(12):7753-7786. doi: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 AD. Quadratically constrained myopic adversarial channels. IEEE Transactions on Information Theory. 2022;68(8):4901-4948. doi: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. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 2021;67(9):5693-5710. doi: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 HD, Sasoglu E, Urbanke RL. Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. 2017;63(7):4298-4316. doi:10.1109/tit.2017.2673829
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv