Gary Lee Mullen

    • 935 Citations
    • 15 h-Index
    1975 …2019
    If you made any changes in Pure, your changes will be visible here soon.

    Fingerprint Dive into the research topics where Gary Lee Mullen is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

    • 2 Similar Profiles
    Galois field Mathematics
    Polynomial Mathematics
    Hypercube Mathematics
    (t, m, s)-nets Mathematics
    Irreducible polynomial Mathematics
    Dickson Polynomials Mathematics
    Permutation Polynomial Mathematics
    Permutation Mathematics

    Network Recent external collaboration on country level. Dive into details by clicking on the dots.

    Research Output 1975 2019

    Sets of mutually orthogonal Sudoku frequency squares

    Ethier, J. T. & Mullen, G. L., Jan 15 2019, In : Designs, Codes, and Cryptography. 87, 1, p. 57-65 9 p.

    Research output: Contribution to journalArticle

    Hypercube
    High-dimensional
    Upper bound

    The number of different reduced complete sets of MOLS corresponding to PG (2,q)

    Hicks, K. H., Mullen, G. L., Storme, L. & Vanpoucke, J., Apr 1 2018, In : Journal of Geometry. 109, 1, 5.

    Research output: Contribution to journalArticle

    Mutually Orthogonal Latin Squares
    Magic square
    Projective plane
    Computational Results
    5 Citations (Scopus)

    Near-complete external difference families

    Davis, J. A., Huczynska, S. & Mullen, G. L., Sep 1 2017, In : Designs, Codes, and Cryptography. 84, 3, p. 415-424 10 p.

    Research output: Contribution to journalArticle

    Difference Family
    Resolvable Design
    Partial Difference Set
    Cyclotomy
    Galois Rings
    2 Citations (Scopus)

    Sudoku-like arrays, codes and orthogonality

    Huggan, M., Mullen, G. L., Stevens, B. & Thomson, D., Mar 1 2017, In : Designs, Codes, and Cryptography. 82, 3, p. 675-693 19 p.

    Research output: Contribution to journalArticle

    Orthogonality
    Linear Array
    Hypercube
    Strip
    Polynomials

    The Polynomial Euclidean Algorithm and the Linear Equation AX + BY = gcd(A, B)

    Effinger, G. & Mullen, G. L., Mar 1 2017, In : Mathematical Intelligencer. 39, 1, p. 22-25 4 p.

    Research output: Contribution to journalArticle

    Euclidean algorithm
    Polynomial Algorithm
    Linear equation
    Equations