Error Correcting Codes & Information Theory with Ron Rothblum
Zero Knowledge
00:00
The Reed-Sullman Error Correcting Code
error correcting codes are this really basic object in computer science. The idea is to encode the message in such a way that even if this encoded message gets partially corrupt, Bob can still recover the message. Most famous example of an error correcting code is what's known as the Reed-Sullman code which uses low degree univariate polynomials. But there are a lot of other great codes around there and we have yet to understand how we can use them in this context but we have new ideas.
Play episode from 21:34
Transcript
