Abstract
An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every graph in the family F is a Cayley graph. This answers a question raised by Tali Kaufman. Using the same methods, we show that the symmetric LDPC codes constructed by Kaufman and Lubotzky (2012) are in fact symmetric under a simply transitive group action on coordinates.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.