Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of irreducible polynomials, including Eisenstein's criterion and properties of finite fields. It discusses the group of units in a finite field being cyclic and the existence of finite fields of prime order. The lecture also explores the uniqueness of finite fields and the construction of fields using irreducible polynomials.