Monday, July 6, 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. Communication Efficient Secret Sharing A secret sharing scheme is a method to store information securely and reliably. Particularly, in the...
  2. Photon-efficient quantum key distribution using time–energy entanglement with high-dimensional encoding Conventional quantum key distribution (QKD) typically uses binary encoding based on photon polarizat...
  3. Residual Votes Attributable to Technology: An Assessment of the Reliability of Existing Voting Equipment American elections are conducted using a hodge-podge of different voting technologies: paper ballots...
  4. 2020 Computing: Can computers help to explain biology? The road leading from computer formalisms to explaining biological function will be difficult, but R...
  5. Polar coding for noisy write-once memories We consider the noisy write-once memory (WOM) model to capture the behavior of data-storage devices ...

Otros recursos de la misma colección

  1. Primary marine aerosol-cloud interactions off the coast of California Primary marine aerosol (PMA)-cloud interactions off the coast of California were investigated using ...
  2. Numerical simulations of the early stages of high-speed droplet breakup Experiments reported in the literature are reproduced using numerical simulations to investigate the...
  3. Topological Valley Currents in Gapped Dirac Materials Gapped 2D Dirac materials, in which inversion symmetry is broken by a gap-opening perturbation, feat...
  4. A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians The density matrix renormalization group method has been extensively used to study the ground state ...
  5. Measurement of the inclusive 3-jet production differential cross section in proton–proton collisions at 7 TeV and determination of the strong coupling constant in the TeV range This paper presents a measurement of the inclusive 3-jet production differential cross section at a ...

Valoración de los usuarios

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

Busque un recurso