Finite fields

[1]  N. J. A. Sloane,et al.  Cyclic self-dual codes , 1983, IEEE Trans. Inf. Theory.

[2]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[3]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[4]  David Singmaster,et al.  Notes on Binomial Coefficients I—A Generalization of Lucas' Congruence , 1974 .

[5]  B. R. McDonald.  Finite Rings With Identity , 1974 .

[6]  N. J. A. Sloane,et al.  New binary codes , 1972, IEEE Trans. Inf. Theory.

[7]  V. Pless.  On the uniqueness of the Golay codes , 1968 .

[8]  E. Berlekamp.  Factoring polynomials over finite fields , 1967 .

[9]  H. Davenport,et al.  Character sums and primitive roots in finite fields , 1963 .

[10]  D. A. Burgess.  A Note on the Distribution of Residues and Non-Residues , 1963 .

[11]  R. G. Swan,et al.  Factorization of polynomials over finite fields. , 1962 .

[12]  D. A. Burgess.  On Character Sums and Primitive Roots , 1962 .

[13]  A. Hausner.  On the quadratic reciprocity theorem , 1961 .

[14]  A. Adrian Albert,et al.  Fundamental Concepts of Higher Algebra , 1958 .

[15]  M. C. R. Butler.  ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1954 .

[16]  I. Vinogradov,et al.  Elements of number theory , 1954 .

[17]  H. Davenport,et al.  ON PRIMITIVE ROOTS IN FINITE FIELDS , 1937 .

[18]  A. Whiteman.  On the law of quadratic reciprocity , 1935 .

[19]  L. Dickson.  History of the Theory of Numbers , 1924, Nature.