License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1802
URN: urn:nbn:de:0030-drops-18024
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1802/
Go to the corresponding LIPIcs Volume Portal

de Wolf, Ronald

Error-Correcting Data Structures

pdf-format:
09001.DeWolfRonald.1802.pdf (0.2 MB)

Abstract

We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, 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 object. 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 {\sc 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.

BibTeX - Entry

@InProceedings{dewolf:LIPIcs:2009:1802,
  author =	{Ronald de Wolf},
  title =	{{Error-Correcting Data Structures}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{313--324},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1802},
  URN =		{urn:nbn:de:0030-drops-18024},
  doi =		{10.4230/LIPIcs.STACS.2009.1802},
  annote =	{Keywords: Data structures, Error-correcting codes, Locally decodable codes, Membership}
}

Keywords: Data structures, Error-correcting codes, Locally decodable codes, Membership
Collection: 26th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2009
Date of publication: 19.02.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI