Everything about Locally testable code
Type of error-correcting code
A locally testable code is a type of error-correcting code for which it can be determined if a string is a word in that code by looking at a small number of bits of the string. In some situations, it is useful to know if the data is corrupted without decoding all of it so that appropriate action can be taken in response. For example, in communication, if the receiver encounters a corrupted code, it can request the data be re-sent, which could increase the accuracy of said data. Similarly, in data storage, these codes can allow for damaged data to be recovered and rewritten properly. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Locally testable codeA 5-minute orientation
- Skim a recent paper: Quantum Locally Testable Code with Constant SoundnessInfluential work since 2022
- Pick up a classic book: Software EngineeringThe most-reprinted book on the subject
- Read the landmark paper: Locally testable codes and PCPs of almost-linear lengthCited 91 times
- Go sideways: Locally decodable codeA closely related topic
- Go sideways: Binary symmetric channelA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Locally testable codes and PCPs of almost-linear length
Robust locally testable codes and products of codes
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
Combinatorial Construction of Locally Testable Codes
Quantum Locally Testable Codes
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
Locally Testable Cyclic Codes
Locally Testable Codes Require Redundant Testers
🆕 Influential since 2022
📚 Books worth reading
Software EngineeringRoger S. Pressman, Bruce Maxim · 1982- 📕ICTE 2015China) International Conference On Transportation Engineering (5th 2015 Dalian Shi · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Locally decodable code A locally decodable code (LDC) is an error-correcting code that allows a single bit of the original message to be decoded with high probability by only…
- Binary symmetric channel A binary symmetric channel (or BSCp) is a common communications channel model used in coding theory and information theory. In this model, a transmitter…
- Zemor's decoding algorithm In coding theory, Zemor's algorithm, designed and developed by Gilles Zémor, is a recursive low-complexity approach to code construction. It is an improvement…
- Small-bias sample space In theoretical computer science, a small-bias sample space (also known as ϵ {\displaystyle \epsilon } -biased sample space, ϵ {\displaystyle \epsilon }…
- Generalized minimum-distance decoding In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using…
- Hadamard code The Hadamard code is an error-correcting code named after the French mathematician Jacques Hadamard that is used for error detection and correction when…
- Folded Reed–Solomon code In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} Reed–Solomon codewords over…
- List decoding In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. The notion was proposed by Elias…