This course covers the learning outcomes and goals of understanding Relaxed Locally Decodable Codes (LDCs) and Relaxed Locally Correctable Codes (LCCs), along with exploring different query regimes and lower bound techniques. The course teaches skills related to decoding codes in various query regimes and speculates on the applications of LDCs. The teaching method involves theoretical lectures and discussions. The intended audience for this course includes students and professionals interested in coding theory and theoretical computer science.
Overview
Syllabus
Intro
Relaxed Locally Decodable Codes (LDCs)
Constant query regime
polylog(n) query regime
List-decoding regime
Relaxed Locally Correctable Codes (LCCS)
Transferring lower bound techniques
More speculations on LDCS
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Relaxed Locally Decodable Codes - Part 1
-
Relaxed Locally Decodable Codes
-
LDPC Codes Achieve List Decoding Capacity
-
Cryptography, Local Decoding, and Distributed Storage
-
Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander
-
Nearly Optimal Pseudorandomness From Hardness
