Maximal negative avoiding sequences exist for every k ≥ 3 and every n ≥ 2.
Lempel,On a homomorphism of the de Bruijn graph and its appli- cation to the design of feedback shift registers, IEEE Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Negative Avoiding Sequences
Maximal negative avoiding sequences exist for every k ≥ 3 and every n ≥ 2.