Cita APA (7a ed.)

Con, R., Guo, Z., Li, R., & Zhang, Z. (2024). Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets.

Cita Chicago Style (17a ed.)

Con, Roni, Zeyu Guo, Ray Li, y Zihan Zhang. Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. 2024.

Cita MLA (9a ed.)

Con, Roni, et al. Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. 2024.