You are here: Wiki>Math Web>WasIstSeminar>WhatIsSeminar>WhatIsListOfTalks>WhatIsGoppaCode (08 Jun 2009, PeterKrautzberger)Edit
What is... a Goppa Code?
This page hosts information on Nathan Ilten's talk "What is ... a Goppa Code?" at the WhatIsSeminar.Abstract
Reed-Solomon codes are widely used in coding theory due to their good parameters and ease of decoding. Goppa codes can in a way be viewed as a generalization of Reed-Solomon codes which, for the most part, maintain these nice properties. In this talk, I hope to briefly recall some basics of coding theory and the definition of Reed-Solomon codes. In what appears to be tangential, I will talk a little about divisors on algebraic curves. However, the definition of Goppa codes should bring everything back together. Time permitting, I will talk about what makes these codes so great.Video
A video of this talk can be found at http://www.scivee.tv/node/11302 .Comments
Edit | Attach | Print version | History: r2 < r1 | Backlinks | View wiki text | Edit wiki text | More topic actions
Topic revision: r2 - 08 Jun 2009, PeterKrautzberger
