Edge transitive ramanujan graphs and symmetric LDPC good codes

DOI10.1145/2213977.2214011zbMath1286.94102arXiv1108.2960OpenAlexW1985695992MaRDI QIDQ5415487

Alexander Lubotzky, Tali Kaufman

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.2960

zbMATH Keywords

error correcting codesLDPC codesRamanujan graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Symmetric unique neighbor expanders and good LDPC codes ⋮ High dimensional expanders and coset geometries ⋮ Ramanujan complexes and high dimensional expanders ⋮ Symmetric LDPC codes and local testing ⋮ Expander graphs in pure and applied mathematics ⋮ Ramanujan graphs arising as weighted Galois covering graphs

This page was built for publication: Edge transitive ramanujan graphs and symmetric LDPC good codes