1. Augot, D., Morain, F.: Discrete logarithm computations over finite fields using Reed-Solomon codes (2012),
http://hal.inria.fr/hal-00672050
2. Boneh, D., Silverberg, A.: Applications of multilinear forms to cryptography. In: Melles, C.G., et al. (eds.) Topics in Algebraic and Noncommutative Geometry; Proceedings in Memory of Ruth Michler, Luminy, France, Annapolis, MD, USA, July 20-22, October 25-28. American Mathematical Society (AMS), Providence (2001); Contemp. Math. 324, 71–90 (2003)
3. Cheng, Q.: Hard problems of algebraic geometry codes. IEEE Trans. Inform. Theory 54(1), 402–406 (2008)
4. Cheng, Q., Wan, D.: On the list and bounded distance decodability of Reed-Solomon codes. SIAM J. Comput. 37(1), 195–209 (2007)
5. Lecture Notes in Computer Science;Q. Cheng,2008