Twice-universal fixed to variable-length random number generators for finite memory sources

Abstract

We study fixed to variable-length random number generators (FVRs) that input a fixed number of symbols from a finite memory source of arbitrary order and unknown parameters, and output a number uniformly distributed in {0, 1,..., M-1}, where M is also random. We review Elias's FVR in the context of the method of types, and show that it remains universal and… (More)
DOI: 10.1109/ISIT.2013.6620303

Topics

1 Figure or Table

Slides referencing similar topics