Logo

Mathematical Sciences Research Institute

Home » MSRI-UP » Schedules » List Decoding algorithms for Reed-Solomon codes and their maximum decoding radii

List Decoding algorithms for Reed-Solomon codes and their maximum decoding radii

MSRI-UP 2009: Coding Theory June 15, 2009 - July 24, 2009

July 24, 2009 (04:30 PM PDT - 05:30 PM PDT)
Speaker(s): Kimberly Heu, Caytlin Parmelee
Location: MSRI: Simons Auditorium
Video
No Video Uploaded
Abstract

Reed-Solomon codes are linear, cyclic codes that can be used to ensure that a correct message is received provided that there are at most a specific number of errors. One of the methods to deal with the decoding of received messages is the Guruswami-Sudan list decoding algorithm. This paper will present several of the properties of list decoding, including a detailed analysis of list decoding with lists of size one and the optimal benefits of list decoding.

Supplements No Notes/Supplements Uploaded
Video/Audio Files
No Video Files Uploaded