BOOK-CHAPTER

Polynomials over Finite Fields

Rudolf LidlHarald Niederreiter

Year: 1996 Cambridge University Press eBooks Pages: 83-146   Publisher: Cambridge University Press

Abstract

The theory of polynomials over finite fields is important for investigating the algebraic structure of finite fields as well as for many applications. Above all, irreducible polynomials—the prime elements of the polynomial ring over a finite field—are indispensable for constructing finite fields and computing with the elements of a finite field.

Keywords:
Finite field Mathematics Computer science Pure mathematics Applied mathematics Discrete mathematics

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.32
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Polynomial and algebraic computation
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

BOOK-CHAPTER

Polynomials Over Finite Fields

Maurice Mignotte

Year: 1992 Pages: 229-288
BOOK-CHAPTER

Polynomials over Finite Fields

Michael Rosen

Graduate texts in mathematics Year: 2002 Pages: 1-9
BOOK-CHAPTER

Polynomials over Finite Fields

Rudolf LidlHarald Niederreiter

Cambridge University Press eBooks Year: 1994 Pages: 76-131
BOOK-CHAPTER

Polynomials over finite fields

Xiang‐dong Hou

Graduate studies in mathematics Year: 2018 Pages: 23-56
JOURNAL ARTICLE

Primitive Polynomials Over Finite Fields

Tom HansenGary L. Mullen

Journal:   Mathematics of Computation Year: 1992 Vol: 59 (200)Pages: 639-639
© 2026 ScienceGate Book Chapters — All rights reserved.