Symmetric LDPC codes and local testing

DOI10.1007/S00493-014-2715-1MaRDI QIDQ519972zbMATH OpenOpenAlexFDO

Authors Tali Kaufman, A. Wigderson

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

zbMATH Keywords

Cayley codeconstant rate codesnon-expanding Schreier graphssemi-direct product groupsymmetric binary codesymmetric LDPC codestransitive binary code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Symmetric LDPC codes and local testing
• LDPC codes constructed from cubic symmetric graphs
• Edge transitive Ramanujan graphs and symmetric LDPC good codes
• Symmetric unique neighbor expanders and good LDPC codes
• Dense locally testable codes cannot have constant rate and distance

Cites work

• A new family of Cayley expanders (?)
• A recursive approach to low complexity codes
• Algebraic property testing: the role of invariance
• Bounds for exponential sums
• Combinatorial construction of locally testable codes (extended abstract)
• Covering spaces of 3-orbifolds
• Edge transitive Ramanujan graphs and symmetric LDPC good codes
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Expander codes
• Expanders in group algebras
• Explicit constructions of Ramanujan complexes of type A_d.
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 475380 (Why is no real title available?)
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• scientific article; zbMATH DE number 3055095 (Why is no real title available?)
• Improved low-degree testing and its applications
• Improved low-density parity-check codes using irregular graphs
• Large groups, property (τ) and the homology growth of subgroups
• Locally testable codes and PCPs of almost-linear length
• Locally Testable Cyclic Codes
• Non-deterministic exponential time has two-prover interactive protocols
• On the symmetry of good nonlinear codes
• Pseudorandom generators without the XOR lemma
• Ramanujan complexes of type \(\widetilde A_d\)
• Randomness conductors and constant-degree lossless expanders
• Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• Semisimple cyclic and Abelian codes. II
• Simple PCPs with poly-log rate and query complexity
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Some 3CNF Properties Are Hard to Test
• Succinct Representation of Codes with Applications to Testing
• Testing Reed–Muller Codes
• The capacity of low-density parity-check codes under message-passing decoding
• The PCP theorem by gap amplification

Cited in

(4)

• Symmetric unique neighbor expanders and good LDPC codes
• Symmetric LDPC codes and local testing
• Edge transitive Ramanujan graphs and symmetric LDPC good codes
• High dimensional expanders and coset geometries

This page was built for publication: Symmetric LDPC codes and local testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519972)