APA   Click to copy
Guo, Z., & Order), Z. Z. (A. Randomly punctured Reed-Solomon codes achieve the list decoding capacity over polynomial-size alphabets. In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, November 6-9, 2023. https://doi.org/10.48550/arXiv.2304.01403

Chicago/Turabian   Click to copy
Guo, Zeyu, and Zihan Zhang (Alphabet Order). “Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets.” In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, November 6-9, 2023., n.d.

MLA   Click to copy
Guo, Zeyu, and Zihan Zhang (Alphabet Order). Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, November 6-9, 2023., doi:10.48550/arXiv.2304.01403.

@conference{zeyu-a,
  title = {Randomly punctured Reed-Solomon codes achieve the list decoding capacity over polynomial-size alphabets},
  publisher = {In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023), Santa Cruz, USA, November 6-9, 2023.},
  doi = {10.48550/arXiv.2304.01403},
  author = {Guo, Zeyu and Order), Zihan Zhang (Alphabet}
}