Symmetric LDPC codes and local testing
暂无分享,去创建一个
[1] Noga Alon,et al. Semi-direct product in groups and zig-zag product in graphs: connections and applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[2] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[3] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[5] Avi Wigderson,et al. Expanders In Group Algebras , 2004, Comb..
[6] L. Carlitz,et al. Bounds for exponential sums , 1957 .
[7] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..
[8] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[9] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[10] Alexander Lubotzky,et al. Explicit constructions of Ramanujan complexes of type , 2005, Eur. J. Comb..
[11] László Babai,et al. Locally testable cyclic codes , 2005, IEEE Transactions on Information Theory.
[12] Avi Wigderson,et al. A new family of Cayley expanders (?) , 2004, STOC '04.
[13] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[14] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[15] D. Spielman,et al. Expander codes , 1996 .
[16] Marc Lackenby. Covering spaces of 3-orbifolds , 2005 .
[17] Madhu Sudan,et al. Succinct Representation of Codes with Applications to Testing , 2009, SIAM J. Discret. Math..
[18] Tali Kaufman,et al. Edge transitive ramanujan graphs and symmetric LDPC good codes , 2012, STOC '12.
[19] Benjamin Weiss,et al. Groups and Expanders , 1992, Expanding Graphs.
[20] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[21] Marc Lackenby,et al. Large groups, property (τ) and the homology growth of subgroups , 2009, Mathematical Proceedings of the Cambridge Philosophical Society.
[22] A. Weil. Sur les courbes algébriques et les variétés qui s'en déduisent , 1948 .
[23] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[24] A. Wigderson,et al. ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.
[25] Michael Horstein,et al. Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963) , 1964, IEEE Transactions on Information Theory.
[26] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[27] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[28] Derek Allan Holton,et al. The Petersen graph , 1993, Australian mathematical society lecture series.
[29] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[30] Eli Ben-Sasson,et al. Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..
[31] Or Meir,et al. Combinatorial construction of locally testable codes , 2008, SIAM J. Comput..
[32] S. Berman. Semisimple cyclic and Abelian codes. II , 1967 .
[33] Robert J. McEliece. On the symmetry of good nonlinear codes , 1970, IEEE Trans. Inf. Theory.
[34] Eli Ben-Sasson,et al. Simple PCPs with poly-log rate and query complexity , 2005, STOC '05.
[35] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[36] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[37] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[38] Daniel A. Spielman,et al. Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[39] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[40] Alexander Lubotzky,et al. Ramanujan complexes of typeÃd , 2005 .