Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed
Generalized Singleton Bound
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed
Generalized Singleton Bound
In this paper, we prove that any `appropriate' folded Reed-Solomon and univariate multiplicity codes achieve relaxed generalized Singleton bound for list size $L\ge1.$ More concretely, we show the following: (1) Any $(s,\gamma)$-folded RS code over the alphabet $\mathbb{F}_q^s$ of block length $n$ and rate $R$ with pair-wise distinct evaluation points …