Let (x t ) be an n-periodic sequence in which the first n elements are drawn i.i.d. according to some rational distribution. We prove there exists a constant C such that whenever m ln m Cn, with probability close to 1, there exists an automaton of size m that matches the sequence at almost all stage
✦ LIBER ✦
“Periods” of de Bruijn sequences
✍ Scribed by Solomon W Golomb
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 273 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Coordination through De Bruijn sequences
✍
Olivier Gossner; Penélope Hernández
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 163 KB
Generation of some de Bruijn sequences
✍
Man-Keung Siu; Po Tong
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 411 KB
The cycle structure of the "connection" of feedback logics is applied to construct more polynomials which generate de Bruijn sequences.
Weight class distributions of de Bruijn
✍
Gregory L. Mayhew
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 275 KB
Order n de Bruijn sequences are the period 2" binary sequences produced by an n stage feedback shift register. The de Bruijn sequences have good randomness and complexity properties. Theorems are given on the weight class distributions of the generator functions. Data that extend the work of Fredric
On the complexities of de Bruijn sequenc
✍
Agnes Hui Chan; Richard A Games; Edwin L Key
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 576 KB
De Bruijn sequences, irreducible codes a
✍
Erik R. Hauge; Tor Helleseth
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 456 KB
Characterizations of generators for modi
✍
Gregory L Mayhew; Solomon W Golomb
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 379 KB