Symmetric unique neighbor expanders and good LDPC codes

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.