A ug 2 01 1 Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes

@inproceedings{Kaufman2011AU2,
  title={A ug 2 01 1 Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes},
  author={Tali Kaufman and Alexander Lubotzky},
  year={2011}
}
We present a symmetric LDPC code with constant rate and constant distance (i.e. good LDPC code) that its constraint space is generated by the orbit of one constant weight constraint under a group action. Our construction provides the first symmetric LDPC good codes. This solves the main open problem raised by Kaufman and Wigderson in [4].