Explore the advanced concepts of Relaxed Locally Decodable Codes (LDCs) in this 16-minute IEEE video lecture. Delve into the constant query regime, polylog(n) query regime, and list-decoding regime. Examine Relaxed Locally Correctable Codes (LCCs) and learn about transferring lower bound techniques. Gain insights into speculations surrounding LDCs and enhance your understanding of these complex coding systems.
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
-
Relaxed Locally Decodable Codes - Part 2
-
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
-
LDPC Codes Achieve List Decoding Capacity
-
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
