Overview 41
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.
Enroll to start learning
You've not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- 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.
Key Concepts
- -- Finite Field
- A set equipped with two operations (addition and multiplication) satisfying the field axioms. Finite fields have a finite number of elements.
- -- Order of a Finite Field
- 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.
- -- Irreducible Polynomial
- A polynomial that cannot be factored into the product of two non-constant polynomials over a given field.
- -- Mapping g
- The function defined to establish a correspondence between r-tuples over Z_p and elements of finite fields.
Additional Learning Materials
Supplementary resources to enhance your learning experience.