Lecture 20: Reed-Solomon Codes
MIT OpenCourseWare · 65:47
Reed–Solomon codes encode a *k*-symbol message as evaluations of a degree-(*k*−1) polynomial over a finite field, giving minimum distance *n*−*k*+1 and the ability to correct *e* errors when *n*−*k* ≥ 2*e*. This lectu...