Monday, March 30, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Efficient Generation of Random Bits From Finite State Markov Chains

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


Detalles del recurso

Pertenece a: Caltech Authors  

Descripción: 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.

Autor(es): Zhou, Hongchao -  Bruck, Jehoshua - 

Id.: 55239736

Versión: 1.0

Estado: Final

Tipo de recurso: Article  -  PeerReviewed  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

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: 04-may-2012

Contacto:

Localización:
* 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. 2020 Computing: Can computers help to explain biology? The road leading from computer formalisms to explaining biological function will be difficult, but R...
  2. Polar coding for noisy write-once memories We consider the noisy write-once memory (WOM) model to capture the behavior of data-storage devices ...
  3. The capacity of string-duplication systems It is known that the majority of the human genome consists of repeated sequences. Furthermore, it is...
  4. Bounds for Permutation Rate-Distortion We study the rate-distortion relationship in the set of permutations endowed with the Kendall t-metr...
  5. A Stochastic Model for Genomic Interspersed Duplication Mutation processes such as point mutation, insertion, deletion, and duplication (including tandem an...

Otros recursos de la misma colección

  1. Gaze bias both reflects and influences preference Emotions operate along the dimension of approach and aversion, and it is reasonable to assume that o...
  2. Molecular physiology of P2X receptors and ATP signalling at synapses ATP is found in every cell, where it is a major source of energy. But in the nervous system, ATP als...
  3. Nucleotide binding by the histidine kinase CheA To probe the structural basis for protein histidine kinase (PHK) catalytic activity and the prospect...
  4. Military-funded research is not unethical The key is to ensure that it is the military rather than the scientists who are regulated.
  5. Programmed population control by cell-cell communication and regulated killing De novo engineering of gene circuits inside cells is extremely difficult, and efforts to realize pre...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso