Notes on de Bruijn sequences (Q1089804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1089804 |
scientific article; zbMATH DE number 4005633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Notes on de Bruijn sequences |
scientific article; zbMATH DE number 4005633 |
Statements
Notes on de Bruijn sequences (English)
0 references
1987
0 references
In this paper the concepts of look-up table, look-up table labels and mini-cycle set are introduced and used to present some algorithms for generating the greatest de Bruijn sequence DB(m,n) and all DB(m,n)'s. Also these algorithms are compared with the Martin algorithm and backtracking algorithms. In the appendix an algorithm for numerically generating r arrangements of n objects is presented.
0 references
look-up table
0 references
look-up table labels
0 references
mini-cycle set
0 references
algorithms
0 references
greatest de Bruijn sequence
0 references
0.853214681148529
0 references
0.8438913226127625
0 references
0.8256345987319946
0 references
