Loading...
Please wait, while we are loading the content...
Similar Documents
Error-Correcting Data Structures
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | de Wolf, Ronald |
| Copyright Year | 2009 |
| Abstract | We study data structures in the presence of adversarial noise. We want to encode a given ob ject in a succinct data structure that enables us to efficiently answer specific queries about the ob ject, even if the data structure has been corrupted by a constant fraction of errors. This new model is the common generalization of (static) data structures and locally decodable error-correcting codes. The main issue is the tradeoff between the space used by the data structure and the time (number of probes) needed to answer a query about the encoded ob ject. We prove a number of upper and lower bounds on various natural error-correcting data structure problems. In particular, we show that the optimal length of error-correcting data structures for the Membership problem (where we want to store subsets of size s from a universe of size n) is closely related to the optimal length of locally decodable codes for s-bit strings. |
| Related Links | https://inria.hal.science/inria-00359651/file/ecdata-stacs_new.pdf |
| Conference Proceedings | 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 |
| Language | English |
| Publisher | HAL CCSD IBFI Schloss Dagstuhl |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | data structures error-correcting codes locally decodable codes membership |
| Content Type | Text |
| Resource Type | Conference Proceedings |
| Subject | Mathematics Computer Science |