1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia

Opción 1: Descargar recurso

Detalles del recurso


The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann's 1951 work. Elias (1972) generalized von Neumann's scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samuelson proposed methods for generating unbiased random bits in the case of correlated sources (of unknown probability distribution), specifically, they considered finite Markov chains. However, their proposed methods are not efficient or have implementation difficulties. Blum (1986) devised an algorithm for efficiently generating random bits from degree-2 finite Markov chains in expected linear time, however, his beautiful method is still far from optimality on information-efficiency. In this paper, we generalize Blum's algorithm to arbitrary degree finite Markov chains and combine it with Elias's method for efficient generation of unbiased bits. As a result, we provide the first known algorithm that generates unbiased random bits from an arbitrary finite Markov chain, operates in expected linear time and achieves the information-theoretic upper bound on efficiency.

Pertenece a

Caltech Authors  


Zhou, Hongchao -  Bruck, Jehoshua - 

Id.: 55239736

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Tipo de recurso: Article  -  PeerReviewed  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] http://resolver.caltech.edu/CaltechAUTHORS:20120503-095551724
[References] http://authors.library.caltech.edu/31292/

Fecha de contribución: 24-ago-2016


* Zhou, Hongchao and Bruck, Jehoshua (2012) Efficient Generation of Random Bits From Finite State Markov Chains. IEEE Transactions on Information Theory, 58 (4). pp. 2490-2506. ISSN 0018-9448. http://resolver.caltech.edu/CaltechAUTHORS:20120503-095551724

Otros recursos del mismo autor(es)

  1. The Robustness of Stochastic Switching Networks Many natural systems, including chemical and biological systems, can be modeled using stochastic swi...
  2. Correcting errors by natural redundancy For the storage of big data, there are significant challenges with its long-term reliability. This p...
  3. Noise and uncertainty in string-duplication systems Duplication mutations play a critical role in the generation of biological sequences. Simultaneously...
  4. Secure RAID schemes from EVENODD and STAR codes We study secure RAID, i.e., low-complexity schemes to store information in a distributed manner that...
  5. Secret sharing with optimal decoding and repair bandwidth This paper studies the communication efficiency of threshold secret sharing schemes. We construct a ...

Otros recursos de la mismacolección

  1. Atmospheric Eddies Mediate Lapse Rate Feedback and Arctic Amplification Projections of amplified climate change in the Arctic are attributed to positive feedbacks associate...
  2. Pigeons (C. livia) Follow Their Head during Turning Flight: Head Stabilization Underlies the Visual Control of Flight Similar flight control principles operate across insect and vertebrate fliers. These principles indi...
  3. On the Consequences of the Detection of an Interstellar Asteroid The robustly hyperbolic asteroid A/2017 U1's arrival (IAU Minor Planet Center 2017a) seems fortuitou...
  4. A Candidate Wide Brown Dwarf Binary in the Argus Association: 2MASS J14504216–7841413 and 2MASS J14504113–7841383 Widely-separated (≳100 au) multiples are rare among the lowest mass stars and brown dwarfs (Caballer...
  5. Human pluripotent stem cell-based models of neuroblastoma Neuroblastoma (NB) is a malignant tumor that accounts for ~15% of all pediatric cancer mortality. Ne...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.