Ben-Sasson-Goldreich-Harsha-Sudan-Vadhan (BGHSV) code[1]

Description

Locally testable \([[n,k,d]]\) code with \(n = k^{1+\epsilon}\) and query complexity of order \(O(1/\epsilon)\) for any \(\epsilon > 0\).

Parent

References

[1]
E. Ben-Sasson et al., “Robust pcps of proximity, shorter pcps and applications to coding”, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04 (2004) DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

edit on this site

Zoo Code ID: bsghsv-ltc

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

Cite as:

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

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/classical/bits/ltc/bsghsv-ltc.yml.