Fetching the paper…
Reading the bibliography…
For an abelian group $H$ acting on the set $[\ell]$, an $(H,\ell)$-lift of a graph $G_0$ is a graph obtained by replacing each vertex by $\ell$ copies, and each edge by a matching corresponding to the action of an element of $H$.
Explicit near-ramanujan graphs of every degree
Sidhanth Mohanty, Ryan O’Donnell, and Pedro Paredes · 1909
Earlier work this paper cites.
Low-density parity-check codes
R. Gallager · 1962
Earlier work this paper cites.
Some results on quasi-cyclic codes
C.L. Chen, W.W. Peterson, and E.J. Weldon · 1969
Earlier work this paper cites.
On the minimum order of graphs with given group
László Babai · 1974
Earlier work this paper cites.
Ramanujan graphs
Alexander Lubotzky, R. Phillips, and Peter Sarnak · 1988
Earlier work this paper cites.
Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators
G. A. Margulis · 1988
Earlier work this paper cites.
On the second eigenvalue of a graph
Alon Nilli · 1991
Earlier work this paper cites.
Random cayley graphs and expanders
Noga Alon and Yuval Roichman · 1994
Earlier work this paper cites.
Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q
M. Morgenstern · 1994
Earlier work this paper cites.
Good quantum error-correcting codes exist
A. R. Calderbank and Peter W. Shor · 1996
Earlier work this paper cites.
Multiple-particle interference and quantum error correction
Andrew Steane · 1996
Earlier work this paper cites.
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
O. Reingold, S. Vadhan, and A. Wigderson · 2000
Earlier work this paper cites.
The Moore bound for irregular graphs
Noga Alon, Shlomo Hoory, and Nathan Linial · 2002
Cited alongside, same era.
Explicit expanders of every degree and size
Noga Alon · 2003
Cited alongside, same era.
Locally testable cyclic codes
László Babai, Amir Shpilka, and Daniel Stefankovic · 2005
Cited alongside, same era.
Lifts, discrepancy and nearly optimal spectral gap
Yonatan Bilu and Nathan Linial · 2006
Cited alongside, same era.
Some randomized code constructions from group actions
L.M.J. Bazzi and S.K. Mitter · 2006
Cited alongside, same era.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Cited alongside, same era.
Algebra-assisted construction of quasi-cyclic LDPC codes for 5G new radio
Huaan Li, Baoming Bai, Xijin Mu, Ji Zhang, and Hengzhou Xu · 2018
Later among the works it cites.
On the Expansion of Group-Based Lifts
Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, and Vivek Madan · 2019
Later among the works it cites.
A Hoeffding inequality for Markov chains
Shravas Rao · 2019
Later among the works it cites.
Shai Evra, Tali Kaufman, and Gilles Zémor · 2020
Later among the works it cites.
Explicit near-fully x-ramanujan graphs
R. O’Donnell and X. Wu · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
Avraham Ben-Aroya and Amnon Ta-Shma · 2008
Cited alongside, same era.
Modern coding theory
Tom Richardson and Ruediger Urbanke · 2008
Cited alongside, same era.
Matthew B. Hastings, Jeongwan Haah, and Ryan O’Donnell · 2009
Cited alongside, same era.
Symmetric LDPC codes and local testing
Tali Kaufman and Avi Wigderson · 2010
Cited alongside, same era.
Pseudorandomness
Salil P. Vadhan · 2012
Cited alongside, same era.
Ramanujan graphs in polynomial time
Michael B. Cohen · 2016
Cited alongside, same era.
Later among the works it cites.
Balanced Product Quantum Codes
Nikolas P. Breuckmann and Jens N. Eberhardt · 2021
Closest in time.
Simultaneous Ccommutativity Of Operators
Keith Conrad · 2021
Closest in time.
Robustly self-ordered graphs: Constructions and applications to property testing
Oded Goldreich and Avi Wigderson · 2021
Closest in time.
Near-optimal cayley expanders for abelian groups
Akhil Jalan and Dana Moshkovitz · 2021
Closest in time.
Asymptotically good quantum and locally testable classical ldpc codes, 2021
Pavel Panteleev and Gleb Kalachev · 2021
Closest in time.
Quantum LDPC Codes with Almost Linear Minimum Distance
Pavel Panteleev and Gleb Kalachev · 2021
Closest in time.