APA
Click to copy
Chen, Y., & Zhang, Z. (2025). Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. To apear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic.
Chicago/Turabian
Click to copy
Chen, Yeyuan, and Zihan Zhang. “Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds.” To apear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic, 2025.
MLA
Click to copy
Chen, Yeyuan, and Zihan Zhang. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. To apear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic, 2025.
BibTeX Click to copy
@conference{yeyuan2025a,
title = {Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds},
year = {2025},
publisher = {To apear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czech Republic},
author = {Chen, Yeyuan and Zhang, Zihan}
}