Local List Decoding from High Dimensional Expanders II

Attend this advanced computer science seminar exploring the construction of locally list decodable codes from high dimensional expanders (HDXs). Begin with a recap of locally list decoding as a powerful coding theory tool and review subspace-based constructions of approximate locally list decodable codes with quasilinear rate. Dive deeper into the decoding algorithm and identify general properties essential for algorithmic success. Explore high dimensional expanders as hypergraph analogues of expander graphs and examine how they satisfy the required properties for improved code rates. Gain insights into why HDXs are particularly suited for this application through the speaker's perspective on tool selection. Learn about cutting-edge research in coding theory and discrete mathematics through work conducted jointly with Max Hopkins, Russell Impagliazzo, and Toniann Pitassi.