Digital communication requires different mechanisms to increase tolerance to errors in communication. Reed-Solomon codes are a class of error-correcting codes defined with polynomials of one variable. Its simple algebraic structure provides many important qualities for protecting against errors. In this talk we will discuss some fundamental concepts of code theory, the construction of Reed-Solomon codes, decoding algorithms and other codes that generalize Reed-Solomon codes.
Colloquium: An introduction to Reed-Solomon codes
0