Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds


Conference


Yeyuan Chen, Zihan Zhang
arXiv preprint, 2024

Arxiv
Cite

Cite

APA   Click to copy
Chen, Y., & Zhang, Z. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. arXiv preprint, 2024.


Chicago/Turabian   Click to copy
Chen, Yeyuan, and Zihan Zhang. “Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds.” arXiv preprint, 2024, n.d.


MLA   Click to copy
Chen, Yeyuan, and Zihan Zhang. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. arXiv preprint, 2024.


BibTeX   Click to copy

@conference{yeyuan-a,
  title = {Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds},
  publisher = {arXiv preprint, 2024},
  author = {Chen, Yeyuan and Zhang, Zihan}
}