New codes on high dimensional expanders
From MaRDI portal
Cites work
- Algebraic methods for interactive proof systems
- Asymptotically good Quantum and locally testable classical LDPC codes
- Binomial determinants, paths, and hook length formulae
- Boolean function analysis on high-dimensional expanders
- Bounded degree cosystolic expanders of every dimension
- Construction of new local spectral high dimensional expanders
- Edge transitive Ramanujan graphs and symmetric LDPC good codes
- Expander codes
- Explicit constructions of Ramanujan complexes of type A_d.
- From Local to Robust Testing via Agreement Testing
- Garland's technique for posets and high dimensional Grassmannian expanders
- High dimensional expanders imply agreement expanders
- High order random walks: beyond spectral gap
- High-dimensional expanders from Chevalley groups
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- IP = PSPACE
- IP = PSPACE using error-correcting codes
- Locally testable codes with constant rate, distance, and locality
- Nearly-linear size holographic proofs
- New affine-invariant codes from lifting
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Ramanujan complexes and bounded degree topological expanders
- Ramanujan complexes of type \(\widetilde A_d\)
- Sub-Constant Error Low Degree Test of Almost-Linear Size
- Symmetric LDPC codes and local testing
This page was built for publication: New codes on high dimensional expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296779)
