Arithmetic in a Finite Field

DOI10.2307/2006401zbMath0454.12007OpenAlexW4230947075MaRDI QIDQ3901590

Michael Willett

Publication date: 1980

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

zbMATH Keywords

decoding an error-correcting codeprimitive normal polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Decoding (94B35) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (2)

Univariate polynomial factorization over finite fields ⋮ Polynomial pseudo-random number generator via cyclic phase

Cites Work

• Unnamed Item
• Finite Field Arithmetic on an Array Processor
• Computing in GF(q)
• Bases for Finite Fields
• Computation with finite fields

This page was built for publication: Arithmetic in a Finite Field