Transcription of Decoding Reed-Muller codes over product sets
{{id}} {{{paragraph}}}
Error-correcting codesPolynomial-based codesEfficient Decoding of Reed-Muller codesDecoding Reed-Muller codes over product setsJohn Kim, Swastik KoppartyRutgers UniversityMay 30, 2016 John Kim, Swastik KoppartyDecoding Reed-Muller codes over product setsError-correcting codesPolynomial-based codesEfficient Decoding of Reed-Muller codesOverview1 Error-correcting codesMotivation2 Polynomial-based codesReed-Solomon codesReed- muller codes3 Efficient Decoding of Reed-Muller codesPolynomial time decoderNear-linear time decoderJohn Kim, Swastik KoppartyDecoding Reed-Muller codes over product setsError-correcting codesPolynomial-based codesEfficient Decoding of Reed-Muller codesMotivationError-correcting codesGoal:Send a message Don t shoot the boy.
Error-correcting codes Polynomial-based codes E cient decoding of Reed-Muller codes Reed-Solomon codes Reed-Muller codes Decoding Reed-Solomon codes
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}