Symmetric LDPC codes and local testing-Reference-Cited by-同舟云学术

Symmetric LDPC codes and local testing

Published:2015-07-23 Issue:1 Volume:36 Page:91-120
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Kaufman Tali,Wigderson Avi

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-014-2715-1.pdf

Reference39 articles.

1. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn and D. Ron: Testing Low Degree Polynomials Over GF(2), in: Proceedings of 7th International Workshop on Randomization and Computation, (RANDOM), Lecture Notes in Computer Science 2764 (2003), 188-199. Also, IEEE Transactions on Information Theory, 51 (2005), 4032–4039.

2. N. Alon, A. Lubotzky and A. Wigderson: Semi Direct product in groups and zig-zag product in graphs: connections and applications, in: Proceedings of the 42nd Annual Symposium on the Foundations of Computer Science (FOCS), 630–637, 2001.

3. S. Arora and M. Sudan: Improved low degree testing and its applications. Combinatorica 23 (2003), 365–426.

4. L. Babai, L. Fortnow and C. Lund: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols, Computational Complexity 1 (1991), 3–40.

5. L. Babai, A. Shpilka and D. Stefankovic: Locally testable cyclic codes, IEEE Transactions on Information Theory 51 (2005), 2849–2858.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. High dimensional expanders and coset geometries;European Journal of Combinatorics;2023-06

2. Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes;Wireless Personal Communications;2022-04-09

3. Construction of new local spectral high dimensional expanders;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20