Don Monroe
Skip Abstract Section
Abstract
Developments from several disparate areas of computer science provide "a huge jump, both technically and also quantitatively."
- Chattopadhyay, E., and Zuckerman, D., Explicit Two-Source Extractors and Resilient Functions, Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 119 (2015), http://eccc.hpi-web.de/report/2015/119/. Google Scholar
Digital Library
- Chattopadhyay, E., and Zuckerman, D., How random is your randomness, and why does it matter? TheConversation.com, Sept. 18, 2016, https://theconversation.com/how-random-is-your-randomness-and-why-does-it-matter-59958.Google Scholar
- Recommendation for the Entropy Sources Used for Random Bit Generation, (Second draft January 2016), National Institute of Standards and Technology Special Publication 800-90B, http://csrc.nist.gov/publications/PubsDrafts.html#800-90B.Google Scholar
- Wigderson, A., Center for the Study of Rationality, Randomness. https://www.youtube.com/watch?v=syUxHJFwwQQ.Google Scholar
Index Terms
- Pure randomness extracted from two poor sources
Recommendations
Extractors for sumset sources
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of ComputingWe propose a new model of weak random sources which we call sumset sources. A sumset source X is the sum of C independent sources, with each source on n bits source having min-entropy k. We show that extractors for this class of sources can be used to ...
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach
The second-order achievable asymptotics in typical random number generation problems such as resolvability, intrinsic randomness, and fixed-length source coding are considered. In these problems, several researchers have derived the first-order and the ...
Comments