Zero-Fixing Extractors for Sub-Logarithmic Entropy

DOI10.1007/978-3-662-47672-7_28zbMath1441.68036OpenAlexW2295571588MaRDI QIDQ3448797

Gil Cohen, Igor Shinkar

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_28

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

How to extract useful randomness from unreliable sources ⋮ Extractors for small zero-fixing sources

Cites Work

• Unnamed Item
• Affine extractors over prime fields
• On the construction of affine extractors
• Randomness is linear in space
• Mining circuit lower bound proofs for meta-algorithms
• An Introduction to Randomness Extractors
• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• Extractors with weak random seeds
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• On extractors and exposure‐resilient functions for sublogarithmic entropy
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Extracting Randomness Using Few Independent Sources
• Simulating independence

This page was built for publication: Zero-Fixing Extractors for Sub-Logarithmic Entropy