Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Discrete Mathematics Using Latin Squares
- P. Shiu, C. Laywine, G. Mullen
- Mathematics
- 3 September 1998
LATIN SQUARES. A Brief Introduction to Latin Squares. Mutually Orthogonal Latin Squares. GENERALIZATIONS. Orthogonal Hypercubes. Frequency Squares. RELATED MATHEMATICS. Principle of… Expand
Handbook of Finite Fields
- G. Mullen, D. Panario
- Mathematics, Computer Science
- Discrete mathematics and its applications
- 17 June 2013
TLDR
Existence and properties of k-normal elements over finite fields
- Sophie Huczynska, G. Mullen, D. Panario, D. Thomson
- Mathematics, Computer Science
- Finite Fields Their Appl.
- 1 November 2013
An element α ? F q n is normal over F q if { α , α q , ? , α q n - 1 } is a basis for F q n over F q . It is well known that α ? F q n is normal over F q if and only if the polynomials g α ( x ) = α… Expand
Primitive polynomials over finite fields
In this note we extend the range of previously published tables of primitive polynomials over finite fields. For each p" < 1050 with p < 97 we provide a primitive polynomial of degree n over Fp .… Expand
Reversed Dickson polynomials over finite fields
- X. Hou, G. Mullen, J. A. Sellers, J. Yucas
- Mathematics, Computer Science
- Finite Fields Their Appl.
- 1 December 2009
TLDR
Finite fields, coding theory, and advances in communications and computing
- G. Mullen, Peter Jau-Shyong Shiue, Advances in Communications
- Computer Science
- 1993
TLDR
- 91
- 6
- PDF
Distribution of irreducible polynomials of small degrees over finite fields
- Kie H. Ham, G. Mullen
- Mathematics, Computer Science
- Math. Comput.
- 1998
TLDR
Completely Normal Primitive Basis Generators of Finite Fields
- Ilene H. Morgan, G. Mullen
- Mathematics
- 1996
- 9
- 6
Products of mixed covering arrays of strength two
- C. Colbourn, Sosina Martirosyan, G. Mullen, D. Shasha, George B. Sherwood, J. Yucas
- Mathematics
- 1 March 2006
A covering arrayCA(N;t,k, v is an N × k array such that every N × t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to… Expand