Saturday, January 31, 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. Logic operations in memory using a memristive Akers array In-memory computation is one of the most promising features of memristive memory arrays. In this pap...
  2. Entanglement-based quantum communication secured by nonlocal dispersion cancellation Quantum key distribution (QKD) enables participants to exchange secret information over long distanc...
  3. Approximate Sorting of Data Streams with Limited Storage We consider the problem of approximate sorting of a data stream (in one pass) with limited internal ...
  4. A simple class of efficient compression schemes supporting local access and editing In this paper, we study the problem of compressing a collection of sequences of variable length that...
  5. Low-density random matrices for secret key extraction Secret key extraction, the task of extracting a secret key from shared information that is partially...

Otros recursos de la misma colección

  1. Uranus: microwave images Observations of Uranus at wavelengths of 2 and 6 centimeters with the Very Large Array were made in ...
  2. Synthetic Biology of Multicellular Systems: New Platforms and Applications for Animal Cells and Organisms Like life itself, synthetic biology began with unicellular organisms. Early synthetic biologists bui...
  3. Position-momentum uncertainty relations in the presence of quantum memory A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that...
  4. Effects of seed magnetic fields on magnetohydrodynamic implosion structure and dynamics The effects of various seed magnetic fields on the dynamics of cylindrical and spherical implosions ...
  5. Low-order modeling of wind farm aerodynamics using leaky Rankine bodies We develop and characterize a low-order model of the mean flow through an array of vertical-axis win...

Valoración de los usuarios

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

Busque un recurso