Improved Decoding of Expander Codes

Published on ● Video Link: https://www.youtube.com/watch?v=FjJtxZM-y6U



Duration: 25:40
221 views
3


13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

Improved Decoding of Expander Codes

Xue Chen (University of Science and Technology of China)
Kuan Cheng (Peking University)
Xin Li (Johns Hopkins University)
Minghui Ouyang (Peking University)

https://doi.org/10.4230/LIPIcs.ITCS.2022.43




Other Videos By Simons Institute for the Theory of Computing


2022-01-28Circuit lower bounds for low-energy states of quantum code Hamiltonians
2022-01-28A Unifying Framework for Characterizing and Computing Width Measures
2022-01-28Embeddings and labeling schemes for A*
2022-01-28Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity
2022-01-28Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs
2022-01-28Time-Traveling Simulators Using Blockchains and Their Applications
2022-01-28An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes
2022-01-28Pre-Constrained Encryption
2022-01-28Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
2022-01-28Correlation detection in trees for planted graph alignment
2022-01-28Improved Decoding of Expander Codes
2022-01-28Interactive Proofs for Synthesizing Quantum States and Unitaries
2022-01-28PCPs and Instance Compression from a Cryptographic Lens
2022-01-28Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu
2022-01-28Quantum Meets the Minimum Circuit Size Problem
2022-01-28Adversarially Robust Coloring for Graph Streams
2022-01-28A Spectral Approach to Polytope Diameter
2022-01-28Matroid Secretary is Equivalent to Contention Resolution
2022-01-28Omnipredictors
2022-01-28Locality-Preserving Hashing for Shifts with Connections to Cryptography
2022-01-28Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity v