Skip to search formSkip to main contentSkip to account menu

Locally decodable code

Known as: Locally decodable 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Computational complexity theoryComputationally bounded adversaryConcatenationForward error correction

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A theory of locally decodable codes
In this thesis we study Locally Decodable Codes. A code C is said to be Locally Decodable Code (LDC) with q queries if it is… 
2012
2012
From irreducible representations to locally decodable codes
A q-query Locally Decodable Code (LDC) is an error-correcting code that allows to read any particular symbol of the message by… 
Review
2011
Review
2011
Locally Decodable Codes: A Brief Survey
Locally decodable codes are error correcting codes that simultaneously provide efficient random-access to encoded data and high… 
2011
2011
Towards lower bounds on locally testable codes via density arguments
The main open problem in the area of locally testable codes (LTCs) is whether there exists an asymptotically good family of LTCs… 
2010
2010
Locally decodable codes via the point removal method
This chapter contains a detailed exposition of the point removal method for constructing locally decodable codes. The method can… 
2009
2009
Unbalanced and Balanced 2-Group Decodable Spatial Multiplexing Code
Spatial multiplexing code (SMC) has high transmis- sion code rate but also high maximum likelihood (ML) decoding complexity. To… 
2008
2008
Locally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A $q$-query \emph{locally decodable quantum code… 
2005
2005
Lower bounds for adaptive locally decodable codes
An error‐correcting code is said to be locally decodable if a randomized algorithm can recover any single bit of a message by… 
Highly Cited
2004
Highly Cited
2004
Improved Lower Bounds for Lo ally De odable Codesand Private Information
2002
2002
Matched information rate codes for binary ISI channels
We propose a coding/decoding strategy to approach the channel capacities for binary intersymbol interference (ISI) channels. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)