Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.”10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory, vol. 68, no. 6, IEEE, 2022, pp. 3823–28, doi:10.1109/TIT.2022.3148779.

Zhang, Yihan, and Shashank Vatedka. “List Decoding Random Euclidean Codes and Infinite Constellations.”10.1109/TIT.2022.3189542__IEEE Transactions on Information Theory, vol. 68, no. 12, IEEE, 2022, pp. 7753–86, doi:10.1109/TIT.2022.3189542.

Zhang, Yihan, et al. “Quadratically Constrained Myopic Adversarial Channels.”10.1109/tit.2022.3167554__IEEE Transactions on Information Theory, vol. 68, no. 8, Institute of Electrical and Electronics Engineers, 2022, pp. 4901–48, doi:10.1109/tit.2022.3167554.

Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.”10.1109/TIT.2020.3038806__IEEE Transactions on Information Theory, vol. 67, no. 9, IEEE, 2021, pp. 5693–710, doi:10.1109/TIT.2020.3038806.

Kudekar, Shrinivas, et al. “Reed–Muller Codes Achieve Capacity on Erasure Channels.”10.1109/tit.2017.2673829__IEEE Transactions on Information Theory, vol. 63, no. 7, IEEE, 2017, pp. 4298–316, doi:10.1109/tit.2017.2673829.

Mondelli, Marco, et al. “Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.”10.1109/tit.2016.2616117__IEEE Transactions on Information Theory, vol. 62, no. 12, IEEE, 2016, pp. 6698–712, doi:10.1109/tit.2016.2616117.