Ben-Sasson-Sudan code[1]
Description
Locally testable \([n,k/2,d]_{2^m}\) code with \(k\) a power of two, \(n = k \log^{c} k\), and query complexity \(\log^{c}k\) for some universal constant \(c\).Member of code lists
Primary Hierarchy
References
- [1]
- E. Ben-Sasson and M. Sudan, “Simple PCPs with poly-log rate and query complexity”, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing 266 (2005) DOI
Page edit log
- Victor V. Albert (2022-09-30) — most recent
Cite as:
“Ben-Sasson-Sudan code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/bs-ltc