Computing in GF(q)

DOI10.2307/2005374MaRDI QIDQ4046145zbMATH OpenOpenAlexFDO

Authors 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

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) Separable extensions, Galois theory (12F10)

Cited in

(6)

• Matrix fields, regular and irregular: A complete fundamental characterization
• 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
• Arithmetic in a Finite Field
• Some Primitive Polynomials of the Third Kind
• Search of primitive polynomials over finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4046145)