Omnibus Sequences, Coupon Collection, and Missing Word Counts
classification
🧮 math.PR
math.CO
keywords
omnibuscouponlengthpossiblesequencesclassicalcollectioncollector
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.