1. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968. (Revised edition, Laguna Hills: Aegean Park Press, 1984.)
2. R.E. Blahut, “Decoding of cyclic codes and codes on curves,” in spivnHandbook of Coding Theory, Vol. II (Eds. V. S. Pless, W. C. Huffman and R. A. Brualdi), Elsevier, 1998, 1569–1633.
3. I. F. Blake, S. Gao, and R. C. Mullin, “Explicit factorization of x
2k
+ 1 over F
p with prime p ≡ 3 (mod 4),” App. Alg. in Eng., Comm. and Comp.
4 (1993) 89–94.
4. D. G. Cantor, “On arithmetical algorithms over finite fields,” J. of Combinatorial Theory
A 56 (1989), 285–300.
5. S. Gao, “Additive fast Fourier transforms over finite fields,” in preparation.