Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648738 | Discrete Mathematics | 2010 | 4 Pages |
Abstract
We consider words over a finite alphabet with certain uniqueness properties (a subsequence of length kk does not occur more than once) and distance properties (at least jj other symbols separate the occurrence of the same symbol). The maximal length of these words is realised by linear de Bruijn sequences with certain forbidden subsequences. We prove the existence of these maximal sequences.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Rudi Penne,