Search the courses, subjects, tracks, games and features, or jump straight to a page.
The lecture discusses the properties of finite fields, particularly the order of a finite field, which can be expressed as a prime number raised to a power. A strong theorem is proven, showing that for any finite field with prime characteristic, the number of elements within the field is of the form p^r. Additionally, the process of constructing finite fields using irreducible monic polynomials is explored, providing a framework to follow for finite fields of various orders.
Chapter 2514 sections
The lecture discusses the properties of finite fields, particularly the order of a finite field, which can be expressed as a prime number raised to a power. A strong theorem is proven, showing that for any finite field with prime characteristic, the number of elements within the field is of the form p^r. Additionally, the process of constructing finite fields using irreducible monic polynomials is explored, providing a framework to follow for finite fields of various orders.
The order of a finite field is of the form p^r, where p is prime.
Finite fields can be constructed using irreducible monic polynomials over Z.
The mapping between r-tuples and finite field elements confirms that the number of distinct elements matches the cardinality expected by the field order.
A set equipped with two operations (addition and multiplication) satisfying the field axioms. Finite fields have a finite number of elements.
The number of elements in a finite field, which is of the form p^r where p is a prime number and r is a positive integer.
A polynomial that cannot be factored into the product of two non-constant polynomials over a given field.
The function defined to establish a correspondence between r-tuples over Z_p and elements of finite fields.
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Get your answers marked and your progress tracked