List-decoding random codes ensembles

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=aEfk5DuvrE0


Duration: 46:14
125 views
2

Ray Li (UC Berkeley)
https://simons.berkeley.edu/talks/ray-li-uc-berkeley-2024-04-11
Advances in the Theory of Error-Correcting Codes



Other Videos By Simons Institute for the Theory of Computing


2024-04-30Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
2024-04-30QEC demonstrations leveraging dynamic circuits
2024-04-30Scheduling syndrome measurement circuits
2024-04-30Halving the cost of surface codes by running error correction at the logical level
2024-04-30A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing
2024-04-30Quantum neural networks
2024-04-30Classical algorithm for simulating experimental Gaussian boson sampling
2024-04-30Dawn in the age of quantum fault tolerance
2024-04-25Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
2024-04-24Parameterized Inapproximability of the Minimum Distance Problem over all Fields...
2024-04-24List-decoding random codes ensembles
2024-04-24Tree codes
2024-04-24An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
2024-04-24Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
2024-04-24Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
2024-04-24Relaxed Local Correctability from Local Testing
2024-04-24Coding Theory in Almost Linear Time and Sublinear Space
2024-04-24Codes with the multiplication property
2024-04-24Dual of (evaluation) codes
2024-04-24Binary Codes with Resilience Beyond 1/4 via Interaction
2024-04-24Constant Query Local Decoding Against Deletions Is Impossible


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Advances in the Theory of Error-Correcting Codes
Ray Li