NewEvery arXiv paper, its researchers & institutions — mapped.
paper

Omnibus Sequences, Coupon Collection, and Missing Word Counts

arXiv:0905.4517 · doi:10.1007/s11009-011-9247-6

Abstract

An {\it Omnibus Sequence} of length $n$ is one that has each possible "message" of length $k$ embedded in it as a subsequence. We study various properties of Omnibus Sequences in this paper, making connections, whenever possible, to the classical coupon collector problem.

26 pages