Lower bounds and correctness results for locally decodable codes
We study fundamental properties of Locally Decodable Codes (LDCs). LDCs are motivated by the intuition that traditional codes do not have a good tradeoff between resistance to arbitrary error and probe complexity. For example, if you apply a traditional code on a database, the resulting codeword ca...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/ETD-UT-2011-08-4223 |