Opening Reed Solomon Codes
Reed Solomon Codes
- Length
- 13 min
- Level
- Undergraduate
- Recorded
- Carnegie Mellon University2020
Chapter 1 of 3: Before the lecture
Reed-Solomon codes generalize the Hadamard code by encoding messages as coefficients of univariate higher-degree polynomials and evaluating them over finite fields. The lecture constructs these linear codes, shows their generator matrices as Vandermonde matrices, and establishes their optimal minimum distance through the degree mantra. It then compares their rate and distance parameters against the Singleton bound to demonstrate their optimality among codes with large alphabet sizes.
Your comment is kept while you sign up.Sign in
O'Donnell proves Reed-Solomon distance is exactly via the degree mantra, meeting the Singleton bound.
Reed-Solomon codes generalize the Hadamard code by encoding messages as coefficients of univariate higher-degree polynomials and evaluating them over finite fields. The lecture constructs these linear codes, shows their generator matrices as Vandermonde matrices, and establishes their optimal minimum distance through the degree mantra. It then compares their rate and distance parameters against the Singleton bound to demonstrate their optimality among codes with large alphabet sizes.
This lecture
Lecture 34 of 89 of A Theorist's Toolkit.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.