LDPC Codes Achieve List Decoding Capacity
Offered By: IEEE via YouTube
Course Description
Overview
Explore the groundbreaking research on LDPC codes achieving list decoding capacity in this 23-minute IEEE conference talk. Delve into error-correcting codes, list-decoding, and unique decoding concepts. Examine Gallager's Ensemble and its significance as the first studied family of LDPC codes. Understand the main results presented by researchers from CMU, Haifa, and Stanford universities, focusing on how list-decoding is a local property. Investigate local properties of random linear codes and consider open problems in the field. Gain valuable insights into this cutting-edge area of coding theory and its potential applications.
Syllabus
Intro
Error correcting codes
List-decoding and unique decoding
Which codes are list-decodable?
Gallager's Ensemble First studied family of LDPC codes. Parameters
Our main result
List-decoding is a local property
Local properties of random linear codes
Open problems
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Knowledge and UncertaintyBrilliant Lecture: Epistemological emergence
Santa Fe Institute via Complexity Explorer Introduction to Complexity
Santa Fe Institute via Complexity Explorer Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer Introduction to Complexity
Santa Fe Institute via Complexity Explorer