Bounds on list decoding of MDS codes
JØrn Justesen, Tom Høholdt · IEEE Transactions on Information Theory · 2001
We derive upper bounds on the number of errors that can be corrected by list decoding of maximum-distance separable (MDS) codes using small lists. We show that the performance of Reed-Solomon (RS) codes, for certain parameter values, is limited by worst case codeword configurations, but that with randomly chosen codes over large alphabets, more errors can be corrected.