On estimating the alphabet size of a discrete random source
Data Structures and Algorithms
2017-11-22 v1
Abstract
We are concerned with estimating alphabet size from a stream of symbols taken uniformly at random from that alphabet. We define and analyze a memory-restricted variant of an algorithm that have been earlier proposed for this purpose. The alphabet size can be estimated in time and space by the memory-restricted variant of this algorithm.
Keywords
Cite
@article{arxiv.1711.07545,
title = {On estimating the alphabet size of a discrete random source},
author = {Philip Ginzboorg},
journal= {arXiv preprint arXiv:1711.07545},
year = {2017}
}