Omnibus Sequences, Coupon Collection, and Missing Word Counts

Details Omnibus Sequences, Coupon Collection, and Missing Word Counts Omnibus Sequences, Coupon Collection, and Missing Word Counts

2009-05-27

arxiv.org/abs/0905.4517v1

Mathematics

Probability

26 pages

Scientific paper

10.1007/s11009-011-9247-6

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.

Affiliated with

Also associated with

No associations

Rating

Omnibus Sequences, Coupon Collection, and Missing Word Counts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Omnibus Sequences, Coupon Collection, and Missing Word Counts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Omnibus Sequences, Coupon Collection, and Missing Word Counts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-293037