YoVDO

Coding Theory in Almost Linear Time and Sublinear Space

Offered By: Simons Institute via YouTube

Tags

Coding Theory Courses Asymptotic Analysis Courses Error-Correcting Codes Courses Algorithmic Complexity Courses Hashing Courses Derandomization Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking lecture on coding theory presented by Dana Moshkovitz from the University of Texas at Austin. Delve into the construction of asymptotically good error-correcting codes that can be deterministically encoded in almost linear time and sub-linear space. Discover innovative techniques for creating codes that can be deterministically decoded with similar complexity. Learn about the use of hashing in encodable codes and the application of locally correctable codes combined with a novel efficient derandomization method for decodable codes. Gain insights into this cutting-edge research, which is based on joint work with Joshua Cook from the University of Texas at Austin, as part of the "Advances in the Theory of Error-Correcting Codes" series at the Simons Institute.

Syllabus

Coding Theory in Almost Linear Time and Sublinear Space


Taught by

Simons Institute

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Algorithmic Thinking (Part 1)
Rice University via Coursera
Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera
Теория функций комплексного переменного
Higher School of Economics via Coursera