Fetching the paper…
Reading the bibliography…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC).
Binomial determinants, paths, and hook length formulae
Ira Gessel and Gérard Viennot · 1985
Earlier work this paper cites.
IP = PSPACE
A. Shamir · 1990
Earlier work this paper cites.
Algebraic methods for interactive proof systems
C. Lund, L. Fortnow, H. Karloff, and N. Nisan · 1992
Earlier work this paper cites.
Nearly-linear size holographic proofs
Alexander Polishchuk and Daniel A. Spielman · 1994
Earlier work this paper cites.
Expander codes
Michael Sipser and Daniel A. Spielman · 1996
Earlier work this paper cites.
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
R. Raz and S. Safra · 1997
Earlier work this paper cites.
Proof verification and intractability of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998
Earlier work this paper cites.
Probabilistic checking of proofs: A new characterization of NP
S. Arora and S. Safra · 1998
Earlier work this paper cites.
Explicit constructions of Ramanujan complexes of type A d ~ \tilde{A_{d}}
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Earlier work this paper cites.
Ramanujan complexes of type A d ~ \tilde{A_{d}}
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Earlier work this paper cites.
Sub-constant error low degree test of almost-linear size
Dana Moshkovitz and Ran Raz · 2008
Earlier work this paper cites.
Edge transitive ramanujan graphs and symmetric LDPC good codes
Tali Kaufman and Alexander Lubotzky · 2012
Earlier work this paper cites.
New affine-invariant codes from lifting
Alan Guo, Swastik Kopparty, and Madhu Sudan · 2013
Cited alongside, same era.
IP = PSPACE using error-correcting codes
Or Meir · 2013
Cited alongside, same era.
Ramanujan complexes and bounded degree topological expanders
Tali Kaufman, David Kazhdan, and Alexander Lubotzky · 2014
Cited alongside, same era.
Bounded degree cosystolic expanders of every dimension
Shai Evra and Tali Kaufman · 2016
Cited alongside, same era.
Symmetric LDPC codes and local testing
Tali Kaufman and Avi Wigderson · 2016
Cited alongside, same era.
High dimensional expanders imply agreement expanders
Irit Dinur and Tali Kaufman · 2017
Cited alongside, same era.
A note on the elementary HDX construction of kaufman-oppenheim
Prahladh Harsha and Ramprasad Saptharishi · 2019
Later among the works it cites.
Locally testable codes via high-dimensional expanders
Yotam Dikstein, Irit Dinur, Prahladh Harsha, and Noga Ron-Zewi · 2020
Later among the works it cites.
Locally testable codes via high-dimensional expanders
Yotam Dikstein, Irit Dinur, Prahladh Harsha, and Noga Ron-Zewi · 2020
Later among the works it cites.
High order random walks: Beyond spectral gap
Tali Kaufman and Izhar Oppenheim · 2020
Later among the works it cites.
Locally testable codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2022
Later among the works it cites.
Locally testable codes with constant rate, distance, and locality
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Luna Frank-Fischer, Venkatesan Guruswami, and Mary Wootters · 2017
Cited alongside, same era.
Boolean function analysis on high-dimensional expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha · 2018
Cited alongside, same era.
Pseudorandom sets in grassmann graph have near-perfect expansion
Subhash Khot, Dor Minzer, and Muli Safra · 2018
Cited alongside, same era.
Construction of new local spectral high dimensional expanders
Tali Kaufman and Izhar Oppenheim · 2018
Cited alongside, same era.
Graph codes and local systems, 2018
Roy Meshulam · 2018
Cited alongside, same era.
From local to robust testing via agreement testing
Irit Dinur, Prahladh Harha, Tali Kaufman, and Noga Ron-zewi · 2019
Cited alongside, same era.
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2022
Later among the works it cites.
On good 2 2 -query locally testable codes from sheaves on high dimensional expanders
Uriya A First and Tali Kaufman · 2022
Later among the works it cites.
High-dimensional expanders from chevalley groups
Ryan O’Donnell and Kevin Pratt · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
From grassmannian to simplicial high-dimensional expanders
Louis Golowich · 2023
Closest in time.
Garland’s technique for posets and high dimensional grassmannian expanders
Tali Kaufman and Ran J. Tessler · 2023
Closest in time.