@inproceedings{ba54cb01057e4b2393338690be39e17f,
title = "Edge transitive Ramanujan graphs and symmetric LDPC good codes",
abstract = "We present the first explicit construction of a binary symmetric code with constant rate and constant distance (i.e., good code). Moreover, the code is LDPC and its constraint space is generated by the orbit of one constant weight constraint under the group action. Our construction provides the first symmetric LDPC good codes. In particular, it solves the main open problem raised by Kaufman and Wigderson {8}.",
keywords = "Error correcting codes, LDPC codes, Ramanujan graphs",
author = "Tali Kaufman and Alexander Lubotzky",
year = "2012",
doi = "10.1145/2213977.2214011",
language = "الإنجليزيّة",
isbn = "9781450312455",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "359--365",
booktitle = "STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing",
note = "44th Annual ACM Symposium on Theory of Computing, STOC '12 ; Conference date: 19-05-2012 Through 22-05-2012",
}