Metraipolis › archive › dc_f18f65adea21
Locally decodable code — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Locally_decodable_code
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T18:21:49.600Z
- SHA-256 of the archived text
8df273157942bcb6b7a82978b9abe3a3549f75d292bbc8346e0b47168dd0b57d- Stable URL of this page
https://metraipolis.com/documento/dc_f18f65adea21
How to cite
Locally decodable code — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Locally_decodable_code (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_f18f65adea21 (Metraipolis archive dc_f18f65adea21, sha256 8df273157942bcb6b7a82978b9abe3a3549f75d292bbc8346e0b47168dd0b57d)
BibTeX
@misc{dcf18f65adea21,
title = {Locally decodable code — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Locally_decodable_code},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_f18f65adea21; sha256 8df273157942bcb6b7a82978b9abe3a3549f75d292bbc8346e0b47168dd0b57d},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Locally_decodable_code. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 examining (or querying) a small number of bits of a possibly corrupted codeword. This property could be useful, say, in a context where information is being transmitted over a noisy channel, and only a small subset of the data is required at a particular time and there is no need to decode the entire message at once. Locally decodable codes are not a subset of locally testable codes, though there is some overlap between the two. Codewords are generated from the original message using an algorithm that introduces a certain amount of redundancy into the codeword; thus, the codeword is always longer than the original message. This redundancy is distributed across the codeword and allows the original message to be recovered with good probability even in the presence of errors. The more redundant the codeword, the more resilient it is against errors, and the fewer queries required to recover a bit of the original message. Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «information retrieval»). Fonte: Wikipedia in inglese, voce «Locally decodable code» — https://en.wikipedia.org/wiki/Locally_decodable_code Wikidata Q6664678 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6664678 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Locally_decodable_code?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1362628428, consultata il 2026-10-07T17:52:14.330Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4345f9290380acc71376106f7237cb5c3c1cd9e2ae54b075c72aff40059a02cf