Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets


Conference


Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
arXiv preprint, 2024

Arxiv
Cite

Cite

APA   Click to copy
Con, R., Guo, Z., Li, R., & Zhang, Z. Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. arXiv preprint, 2024.


Chicago/Turabian   Click to copy
Con, Roni, Zeyu Guo, Ray Li, and Zihan Zhang. “Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets.” arXiv preprint, 2024, n.d.


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


BibTeX   Click to copy

@conference{con-a,
  title = {Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets},
  publisher = {arXiv preprint, 2024},
  author = {Con, Roni and Guo, Zeyu and Li, Ray and Zhang, Zihan}
}