Symmetric LDPC Codes and Local Testing
From MaRDI portal
Publication:4933383
DOI10.1007/978-3-642-16367-8_25zbMath1309.68224OpenAlexW2266044771MaRDI QIDQ4933383
Publication date: 12 October 2010
Published in: Property Testing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_25
Related Items
Symmetric unique neighbor expanders and good LDPC codes ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Invariance in Property Testing ⋮ Expander graphs in pure and applied mathematics
Cites Work
- Non-deterministic exponential time has two-prover interactive protocols
- Expanders in group algebras
- Covering spaces of 3-orbifolds
- Self-testing/correcting with applications to numerical problems
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Improved low-degree testing and its applications
- Expander codes
- Locally testable codes and PCPs of almost-linear length
- Locally Testable Cyclic Codes
- Randomness conductors and constant-degree lossless expanders
- A new family of Cayley expanders (?)
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Simple PCPs with poly-log rate and query complexity
- Large groups, property (τ) and the homology growth of subgroups
- Succinct Representation of Codes with Applications to Testing
- A recursive approach to low complexity codes
- Improved low-density parity-check codes using irregular graphs
- The capacity of low-density parity-check codes under message-passing decoding
- Robust Characterizations of Polynomials with Applications to Program Testing
- On the symmetry of good nonlinear codes
- Some 3CNF Properties Are Hard to Test
- Bounds for exponential sums
- The PCP theorem by gap amplification
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Pseudorandom generators without the XOR lemma
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
