YoVDO

Locally Testable Codes with Constant Rate, Distance, and Locality

Offered By: Simons Institute via YouTube

Tags

Coding Theory Courses Computer Science Courses Mathematics Courses

Course Description

Overview

Explore a groundbreaking lecture on locally testable codes with constant rate, distance, and locality presented by Irit Dinur from the Weizmann Institute of Science. Delve into the history and fundamentals of local testable codes, high-dimensional expander codes, and their applications. Examine the main results, including expander codes, Tanner codes, and situation codes. Understand the intricacies of defining expander codes, complex squares, and code words. Investigate local views as tensor codes and the proof of local testability in this comprehensive 67-minute talk from the Simons Institute's Breakthroughs series.

Syllabus

Introduction
Local Testable Codes
History of Local Testable Codes
Local Checkers
HighDimensional Expanders Codes
Main Result
Expander Codes
Tanner Codes
Situation Codes
Defining Expander Codes
Defining Complex
Squares
Square Complex
Code
Code Words
Local Views
Local Views as Tensor Codes
Local Testability Proof


Taught by

Simons Institute

Related Courses

Code-Based Cryptography
Inria (French Institute for Research in Computer Science and Automation) via France Université Numerique
Современная комбинаторика (Modern combinatorics)
Moscow Institute of Physics and Technology via Coursera
An Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam
Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam
Coding Theory
NPTEL via YouTube