Storing information with extractors.
type: Item
instance of: scholarly article
title: Storing information with extractors.
zbMATH Open document ID: 1051.68049
DOI: 10.1016/S0020-0190(02)00206-5
author: Amnon Ta-Shma
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1856419
zbMATH Keywords: Data structures
zbMATH Keywords: Expanders
zbMATH Keywords: Extractors
zbMATH Keywords: Condensers
zbMATH Keywords: List decoding
MaRDI profile type: Publication
Wikidata QID: Q62398488
cites work: Are bitvectors optimal?
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: Nonoblivious hashing
cites work: List decoding algorithms for certain concatenated codes
cites work: Q5595902
cites work: On recycling the randomness of states in space bounded computation
cites work: Extracting all the randomness and reducing the error in Trevisan's extractors
cites work: Construction of extractors using pseudo-random generators (extended abstract)
cites work: Loss-less condensers, unbalanced expanders, and extractors
cites work: Extractor codes
cites work: Extractor Codes
cites work: Expanders that beat the eigenvalue bound
cites work: Should Tables Be Sorted?
Recommended article: Q4708631
Recommended article: Q4799839
description: scientific article; zbMATH DE number 1856419