By Topic

Fast and efficient construction of an unbiased random sequence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ryabko, B.Ya. ; Dept. of Appl. Math. & Cybernetics, Siberian State Univ. of Telecommun. & Inf. Sci., Novosibirsk, Russia ; Matchikina, E.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )