A note on certain de Bruijn sequences with forbidden subsequences

We consider words over a finite alphabet with certain uniqueness properties (a subsequence of length k does not occur more than once) and distance properties (at least j 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.