Fast List-Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes
Offered By: Simons Institute via YouTube
Course Description
Overview
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
Principles of Digital Communication IIMassachusetts Institute of Technology via MIT OpenCourseWare Secure Computation: Part II
NPTEL via Swayam Algebra in Algorithmic Coding Theory
Fields Institute via YouTube Back to the Future: The Evolution of Coding Theory Through Reed Muller Codes
Simons Institute via YouTube Almost There: Capacity of PIR from Coded and Colluding Servers
Centre International de Rencontres Mathématiques via YouTube