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\).

Parent

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 - STOC ’05 (2005) DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

edit on this site

Zoo Code ID: bs-ltc

Cite as:
“Ben-Sasson-Sudan code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/bs-ltc
BibTeX:
@incollection{eczoo_bs-ltc, title={Ben-Sasson-Sudan code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/bs-ltc} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/bs-ltc

Cite as:

“Ben-Sasson-Sudan code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/bs-ltc

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/classical/q-ary_digits/ltc/bs-ltc.yml.