The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The lexicographically smallest universal cycle for binary strings with minimum specified weight |
scientific article |
Statements
The lexicographically smallest universal cycle for binary strings with minimum specified weight (English)
0 references
5 September 2014
0 references
de Bruijn cycle
0 references
universal cycle
0 references
necklace
0 references
FKM algorithm
0 references
minimum weight
0 references
0 references
