A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice

DOI10.1109/TIT.2014.2381223zbMATH Open1359.68317OpenAlexW2059632334MaRDI QIDQ2978764FDOQ2978764

Authors: Sung-il Pae 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2014.2381223

Recommendations

• scientific article; zbMATH DE number 503342
• ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION
• Generating random permutations by coin tossing: classical algorithms, new analysis, and modern implementation
• On dice and coins: Models of computation for random generation
• scientific article; zbMATH DE number 4117876
• A new general derandomization method
• Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
• An asymptotically perfect pseudorandom generator
• scientific article; zbMATH DE number 3919629
• Exact output rate of Peres's algorithm for random number generation

Mathematics Subject Classification ID

Information theory (general) (94A15) Approximation algorithms (68W25)

This page was built for publication: A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice

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