CaltechAUTHORS
  A Caltech Library Service

A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice

Zhou, Hongchao and Bruck, Jehoshua (2012) A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice. , Pasadena, CA. (Submitted) http://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704

[img] PDF - Submitted Version
See Usage Policy.

181Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704

Abstract

In this paper, we present a universal scheme for transforming an arbitrary algorithm for biased 2-face coins to generate random bits from the general source of an m-sided die, hence enabling the application of existing algorithms to general sources. In addition, we study approaches of efficiently generating a prescribed number of random bits from an arbitrary biased coin. This contrasts with most existing works, which typically assume that the number of coin tosses is fixed, and they generate a variable number of random bits.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
http://arxiv.org/abs/1209.0726arXivDiscussion Paper
Additional Information:This work was supported in part by the NSF Expeditions in Computing Program under grant CCF-0832824.
Funders:
Funding AgencyGrant Number
NSFCCF-0832824
Subject Keywords:Random Number Generation, Biased Coins, Loaded Dice
Record Number:CaltechAUTHORS:20160120-102042704
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:63795
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:20 Jan 2016 20:26
Last Modified:20 Jan 2016 20:26

Repository Staff Only: item control page