Computing in GF(q)

DOI10.2307/2005374zbMath0294.12010OpenAlexW2015672764MaRDI QIDQ4046145

Jacob T. B. jun. Beard

Publication date: 1974

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005374

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (6)

Matrix fields, regular and irregular: A complete fundamental characterization ⋮ Arithmetic in a Finite Field ⋮ Univariate polynomial factorization over finite fields ⋮ Factorization of Q(h(T)(x)) over a finite field where Q(x) is irreducible and h(T)(x) is linear. I ⋮ Some Primitive Polynomials of the Third Kind ⋮ Search of primitive polynomials over finite fields

This page was built for publication: Computing in GF(q)