Factoring Polynomials over Finite Fields
1993
A polynomial of degree n over a finite field F q is an expression in an indeterminate x having the form
$$f(x) = \sum\limits_{i = 0}^n {{a_i}{x^1}} $$
where n is a non-negative integer, a i ∈ F q , 0 ≤ i ≤ n and a n ≠ 0. To be more precise, f (x) is called a univariate polynomial to distinguish the more general situation where more indeterminates are involved. Most of this chapter will deal with univariate polynomials but the multivariate case will be briefly mentioned at the end.
Keywords:
- Irreducible polynomial
- Mathematical analysis
- Koornwinder polynomials
- Askey–Wilson polynomials
- Difference polynomials
- Polynomial
- Factorization of polynomials
- Mathematics
- Berlekamp's algorithm
- Univariate
- Classical orthogonal polynomials
- Hahn polynomials
- Macdonald polynomials
- Combinatorics
- Orthogonal polynomials
- Discrete orthogonal polynomials
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
27
References
0
Citations
NaN
KQI