Computing in GF(q)

DOI10.2307/2005374zbMATH Open0294.12010OpenAlexW2015672764MaRDI QIDQ4046145FDOQ4046145

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) Separable extensions, Galois theory (12F10) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04)

Cited In (6)

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

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)