Omnibus Sequences, Coupon Collection, and Missing Word Counts
Probability
2012-04-12 v1 Combinatorics
Abstract
An {\it Omnibus Sequence} of length is one that has each possible "message" of length 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.
Keywords
Cite
@article{arxiv.0905.4517,
title = {Omnibus Sequences, Coupon Collection, and Missing Word Counts},
author = {Sunil Abraham and Greg Brockman and Stephanie Sapp and Anant P. Godbole},
journal= {arXiv preprint arXiv:0905.4517},
year = {2012}
}
Comments
26 pages