Omnibus Sequences, Coupon Collection, and Missing Word Counts
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
