Symmetric LDPC codes and local testing
From MaRDI portal
Publication:519972
DOI10.1007/s00493-014-2715-1zbMath1399.94088OpenAlexW2136137499MaRDI QIDQ519972
Publication date: 31 March 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.829
Cayley codeconstant rate codesnon-expanding Schreier graphssemi-direct product groupsymmetric binary codesymmetric LDPC codestransitive binary code
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\).
- Non-deterministic exponential time has two-prover interactive protocols
- Expanders in group algebras
- Ramanujan complexes of type \(\widetilde A_d\)
- 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
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Locally testable codes and PCPs of almost-linear length
- Testing Reed–Muller Codes
- 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
- Semisimple cyclic and Abelian codes. II
- 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
- Edge transitive ramanujan graphs and symmetric LDPC good codes
- On the symmetry of good nonlinear codes
- Some 3CNF Properties Are Hard to Test
- Bounds for exponential sums
- The PCP theorem by gap amplification
- Pseudorandom generators without the XOR lemma
This page was built for publication: Symmetric LDPC codes and local testing
