Fast List-Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes

Offered By: Simons Institute via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Explore a 52-minute lecture on fast list-decoding techniques for univariate multiplicity and folded Reed-Solomon codes. Delivered by Prahladh Harsha from the Tata Institute of Fundamental Research, this talk is part of the "Advances in the Theory of Error-Correcting Codes" series at the Simons Institute. Delve into the intricacies of these advanced error-correcting codes and their efficient decoding algorithms. Gain insights into the latest developments in coding theory and their applications in data transmission and storage. Suitable for researchers, graduate students, and professionals in computer science, information theory, and related fields.

Syllabus

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes

Taught by

Simons Institute

Related Courses

Secure Computation: Part II
NPTEL via Swayam CRaft - An Erasure-coding-supported Version of Raft for Reducing Storage Cost
USENIX via YouTube Proximity Gaps for Reed-Solomon Codes
IEEE via YouTube Codes from Polynomials Over Finite Fields
Joint Mathematics Meetings via YouTube Coding Theoretic Framework for Private Information Retrieval - SIAM SAGA Seminar
Society for Industrial and Applied Mathematics via YouTube