Fast and efficient construction of an unbiased random sequence

Authors:
B. Y. Ryabko;E. Matchikina
Affiliations:
Dept. of Appl. Math. & Cybernetics, Siberian State Univ. of Telecommun. & Inf. Sci., Novosibirsk;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

An Efficient Generation Method for Uniformly Distributed Random Numbers

Problems of Information Transmission
Optimum power controller for random number generator in the crypto module of ubiquitous computing environment

EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Randomized algorithm in embedded crypto module

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
The design of random number generator in an embedded crypto module

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
An adaptive filter mechanism of random number generator in a crypto module

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
The fuzzy engine for random number generator in crypto module

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Exact output rate of Peres's algorithm for random number generation

Information Processing Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

The problem of converting a sequence of symbols generated by a Bernoulli source into an unbiased random sequence is well-known in information theory. The proposed method is based on Elias' (1972) algorithm in which the sequence of symbols is divided into blocks of length N,N⩾1. We suggest a new method of constructing an unbiased random sequence which uses O(Nlog2N) bits of memory and takes O(log8Nloglog(N)) bit operations per letter