1. Chien-Yu Chen and Iwan M. Duursma, Geometric Reed-Solomon codes of length 64 and 65 over F8, IEEE Trans. Inform. Theory 49 (2003), no. 5, 1351–1353.[MR]
  2. I. Duursma, P. Gaudry, and F. Morain, Speeding up the discrete log computation on curves with automorphisms, Advances in Cryptology—Asiacrypt'99 (Singapore), Lecture Notes in Comput. Sci., vol. 1716, Springer, Berlin, 1999, pp. 103–121.[MR]