TY - GEN
T1 - Edge transitive Ramanujan graphs and symmetric LDPC good codes
AU - Kaufman, Tali
AU - Lubotzky, Alexander
PY - 2012
Y1 - 2012
N2 - 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}.
AB - 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}.
KW - Error correcting codes
KW - LDPC codes
KW - Ramanujan graphs
UR - http://www.scopus.com/inward/record.url?scp=84862630318&partnerID=8YFLogxK
U2 - 10.1145/2213977.2214011
DO - 10.1145/2213977.2214011
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84862630318
SN - 9781450312455
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 359
EP - 365
BT - STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
T2 - 44th Annual ACM Symposium on Theory of Computing, STOC '12
Y2 - 19 May 2012 through 22 May 2012
ER -