Generators & Randomness
De Bruijn Sequence Generator
Generate a De Bruijn sequence B(k, n) that contains every length-n string over k symbols exactly once. Set k from 2 to 9 and n from 2.
This tool runs open-source code from CyberChef by GCHQ (Apache License 2.0). See open-source credits.
A B(k, n) cycle contains every length-n word from a k-symbol alphabet exactly once.
The result uses digits as symbols and returns a cyclic sequence.
- Exercise every fixed-length symbol combination in a cyclic input test.
Generate every three-bit window
Input: No source text; the two settings define the sequence.
Settings: Alphabet size (k) 3, Key length (n) 2
Result: 001021122
The result contains 3² = 9 symbols.
Set the alphabet size and window length
- Set Alphabet size (k) and Key length (n).
- Select Generate sequence. No source text is needed.
- The sequence is deterministic and unsuitable for passwords.
- Map output symbols separately when your application uses letters.