Cheng Q, Wan D. Complexity of decoding positive rate ReedSolomon codes[C]//35th Inter Colloq Auto, Langu Program, Lec Note Comput Sci. Berlin:SpringerVerlag,2008,5125:283293.
[2]
Li Y J, Wan D. On error distance of ReedSolomon codes[J]. Sci Chin,2008,A51(11):19821988.
[3]
Sudan M. Decoding of ReedSolomon codes beyond the errorcorrection bound[J]. J Complex,1997,13:180193.
[4]
Cheng Q, Murray E. On deciding deep holes of ReedSolomon codes[C]//Theo Appl Mod Comput. Lec Note Comput Sci. Berlin:SpringerVerlag,2007,4484:296305.
[5]
Cheng Q, Wan D. On the list and bounded distance decodibility of the ReedSolomon codes (extended abstract)[C]//45th Ann IEEE Symp Found Comput Sci. Washington D C: IEEE Society,2004:335341.
[6]
Guruswami V, Sudan M. Improved decoding of ReedSolomon and algebraicgeometry codes[J]. IEEE Trans Infor Theory,1999,45(6):17571767.
[7]
Guruswami V, Vardy A. Maximallikelihood decoding of ReedSolomon codes is NPhard[J]. IEEE Trans Infor Theory,2005,51(7):22492256.
[8]
Li J Y, Wan D. On the subset sum problem over finite fields[J]. Finite Fields Appl,2008,14(4):911929.
