Storing information with extractors.

DOI10.1016/S0020-0190(02)00206-5zbMath1051.68049WikidataQ62398488 ScholiaQ62398488MaRDI QIDQ1853081

Amnon Ta-Shma

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Data structuresList decodingCondensersExpandersExtractors

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Reconstructive dispersers and hitting set generators, An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs, Determining membership with 2 simultaneous queries, Pseudo-random graphs and bit probe schemes with one-sided error, Non-interactive timestamping in the bounded-storage model, A Survey of Data Structures in the Bitprobe Model

Cites Work

• Unnamed Item
• Construction of extractors using pseudo-random generators (extended abstract)
• On recycling the randomness of states in space bounded computation
• List decoding algorithms for certain concatenated codes
• Are bitvectors optimal?
• Extractor Codes
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Should Tables Be Sorted?
• Nonoblivious hashing
• Loss-less condensers, unbalanced expanders, and extractors
• Extractor codes
• Expanders that beat the eigenvalue bound
• Extracting all the randomness and reducing the error in Trevisan's extractors