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. Correcting errors by natural redundancy For the storage of big data, there are significant challenges with its long-term reliability. This p...
  2. Noise and uncertainty in string-duplication systems Duplication mutations play a critical role in the generation of biological sequences. Simultaneously...
  3. 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...
  4. Secret sharing with optimal decoding and repair bandwidth This paper studies the communication efficiency of threshold secret sharing schemes. We construct a ...
  5. Duplication Distance to the Root for Binary Sequences We study the tandem duplication distance between binary sequences and their roots. In other words, t...

Otros recursos de la mismacolección

  1. The Solar Neighborhood. XLII. Parallax Results from the CTIOPI 0.9 m Program—Identifying New Nearby Subdwarfs Using Tangential Velocities and Locations on the H–R Diagram Parallaxes, proper motions, and optical photometry are presented for 51 systems consisting of 37 coo...
  2. Generalized double affine Hecke algebras of rank 1 and quantized del Pezzo surfaces Let D be a simply laced Dynkin diagram of rank r whose affinization has the shape of a star (i.e., D...
  3. Uncertainty and the Theory of Tax Incidence in a Stock Market Economy [Introduction] Commencing with Harberger's [1962] classic paper, a number of studies have analyzed t...
  4. Experiments on the Core: Some Disconcerting Results for Majority Rule Voting Games In the context of spatial majority voting games, considerable experimental support exists for the co...
  5. Demand Uncertainty and the Regulated Firm [Introduction] In this paper, we investigate the impact of demand uncertainty on the choice of plant...

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.