Zero-fixing extractors for sub-logarithmic entropy

DOI10.1007/978-3-662-47672-7_28MaRDI QIDQ3448797zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Extractors for small zero-fixing sources
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Deterministic Extractors for Independent-Symbol Sources
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Extractors with weak random seeds

Cites work

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

Cited in

(5)

• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
• How to extract useful randomness from unreliable sources
• Extractors for small zero-fixing sources

This page was built for publication: Zero-fixing extractors for sub-logarithmic entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448797)