Algorithm for the generation of nonlinear de Bruijn sequences (Q1092907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4021144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for the generation of nonlinear de Bruijn sequences |
scientific article; zbMATH DE number 4021144 |
Statements
Algorithm for the generation of nonlinear de Bruijn sequences (English)
0 references
1987
0 references
We propose an algorithm which for any n generates order of \(2^{n^{2- 5}n}\) nonlinear binary sequences of maximum length \(2^ n\) using approximately \(n^ 2-4n\) bits of memory and at most 2n-2 time cycles for the generation of the next symbol as a function of the n preceding symbols.
0 references
algorithm
0 references
nonlinear binary sequences
0 references
0.8429117202758789
0 references
0.8393738865852356
0 references
0.8333845138549805
0 references
