This work studies multivariate interpolation-based list-decoding (MID) of Reed-Solomon and related codes. A universal description of several codes as well as their error-correction radius, list size and complexity under linear-algebraic MID is derived. Furthermore, asymptotic strategies for generalized minimum distance decoding with arbitrary error/erasure tradeoff are presented. The optimal parameters and the decoding radius in terms of the number of decoding trials and error/erasure tradeoff are derived for each strategy.
«
This work studies multivariate interpolation-based list-decoding (MID) of Reed-Solomon and related codes. A universal description of several codes as well as their error-correction radius, list size and complexity under linear-algebraic MID is derived. Furthermore, asymptotic strategies for generalized minimum distance decoding with arbitrary error/erasure tradeoff are presented. The optimal parameters and the decoding radius in terms of the number of decoding trials and error/erasure tradeoff a...
»