Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,626,829 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Computational complexity theory
Computationally bounded adversary
Concatenation
Forward error correction
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Relaxed Locally Correctable Codes in Computationally Bounded Channels*
Jeremiah Blocki
,
V. Gandikota
,
Elena Grigorescu
,
Samson Zhou
International Symposium on Information Theory
2019
Corpus ID: 203566161
Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to…
Expand
2017
2017
Non-Malleable Codes Against Affine Errors
Ryota Iwamoto
,
Takeshi Koshiba
arXiv.org
2017
Corpus ID: 10199354
Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original…
Expand
2013
2013
A theory of locally decodable codes
K. Efremenko
,
Avraham Ben-Aroya
,
Iftah Gamzu
,
Michal Moshkovitz
2013
Corpus ID: 15096027
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…
Expand
Review
2013
Review
2013
Locally decodable codes
E. E. Targhi
2013
Corpus ID: 27906516
Locally decodable codes (LDCs) are error correcting codes that simultaneously provide efficient random-access to encoded data and…
Expand
2012
2012
2 Construction of Locally Decodable Codes
Zachary Abel
2012
Corpus ID: 7390234
In this lecture we will develop a construction of locally decodable codes developed in three papers by Yekhanin, Raghavendra, and…
Expand
2010
2010
Query-Efficient Locally Decodable Codes
Y. Chee
,
Tao Feng
,
S. Ling
,
Huaxiong Wang
,
L. Zhang
Electron. Colloquium Comput. Complex.
2010
Corpus ID: 11284336
2010
2010
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain…
International Workshop and International Workshop…
2010
Corpus ID: 261513278
2009
2009
Delegating computation reliably: paradigms and constructions
G. Rothblum
2009
Corpus ID: 41475868
In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users…
Expand
2005
2005
Lower bounds for adaptive locally decodable codes
A. Deshpande
,
Rahul Jain
,
T. Kavitha
,
Satyanarayana V. Lokam
,
J. Radhakrishnan
Random Struct. Algorithms
2005
Corpus ID: 3720779
An error‐correcting code is said to be locally decodable if a randomized algorithm can recover any single bit of a message by…
Expand
2005
2005
LOCAL DECODING OF WALSH CODES TO REDUCE CDMA DESPREADING COMPUTATION
T. F. Chan
,
J. Feldman
,
P. Indyk
,
David R Karger
2005
Corpus ID: 8645889
The invention is an improved layout for integrated circuits employing local interconnect pads, particularly six-transistor SRAM…
Expand