[1]
P. Beelen, R. Con, A. Gruica, M. Montanucci, and E. Yaakobi, “Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-1/2 Codes,” in 
2025 IEEE International Symposium on Information Theory (ISIT), Ann Arbor, MI, USA: IEEE, June 2025, pp. 1–6. doi: published: 10.1109/ISIT63088.2025.11195607; open access: 10.48550/arXiv.2501.11371. Available: 
https://arxiv.org/abs/2501.11371. [Accessed: Oct. 29, 2025]