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 Reed Solomon Codes, their construction, and properties. It explains how these codes are used in various applications like storage devices, digital broadcast, and modems. The lecture also delves into polynomials over finite fields, Lagrange's interpolation polynomials, and roots of polynomials. The instructor demonstrates the linearity of RS codes and proves their minimum distance. Additionally, the lecture discusses the design parameters of RS codes and their relation to Singleton's bound.