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

From MaRDI portal
















This page was built for publication: Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6742128)