Home › Categories › Technology› Random Bits Generation

Random Bits Generation.pdf

etr102.pdf

🔗 Source: paradise.caltech.edu

📊 Size: 314 KB

📄 Pages: 15 pages

⬇️ Downloads: 159

Summary

The problem of generating random bits from a correlated random source, specifically a finite Markov chain, is addressed. Previous methods, such as those proposed by Elias and Blum, have limitations in terms of efficiency or implementation difficulties. A new algorithm is presented, which generalizes Blum's algorithm to arbitrary degree finite Markov chains and combines it with Elias's method, achieving the information-theoretic upper bound on efficiency. The algorithm generates unbiased random bits from an arbitrary finite Markov chain in expected linear time. Variants of the algorithm, including Algorithm A, Algorithm B, and Algorithm C, are proposed, with Algorithm C being the first known optimal algorithm for random bits generation from an input sequence of length N, with polynomial time complexity.

Download File

Description

The problem of generating random bits from a correlated random source, specifically a finite Markov chain, is addressed.

Technical Information

File Format: PDF
File Size: 314 KB
Pages: 15
Language: EN
Total Downloads: 159
Last Updated: 4 weeks ago

Document Overview

This PDF document about Random Bits Generation provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into Random Bits Generation.