Abstract.
An (n, k)-universal sequence is a binary sequence with the property that each window of size k and span at most n is covered by the sequence, i.e., each sequence of length k occurs as the content of a shift of the window. We derive upper and lower bounds on the minimum length of universal sequences, both for the linear case and the circular case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: November 4, 1996
Rights and permissions
About this article
Cite this article
Hollmann, H., van Lint, J. Universal Sequences. AAECC 8, 347–352 (1997). https://doi.org/10.1007/s002000050071
Issue Date:
DOI: https://doi.org/10.1007/s002000050071