๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new algorithm for the generation of binary de Bruijn sequences

โœ Scribed by Yuejiang Huang

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
375 KB
Volume
11
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Storage efficient decoding for a class o
Storage efficient decoding for a class of binary be Bruijn sequences
โœ K.G. Paterson; M.J.B. Robshaw ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 748 KB

A binary span k de Bruijn sequence is a binary sequence of period 2 k such that each k-tuple of bits occurs exactly once as a subsequence in a period of the sequence. The de Bruijn sequences have applications in position sensing and range finding, as well as in other areas, by virtue of this subsequ

On the complexities of de Bruijn sequenc
On the complexities of de Bruijn sequences
โœ Agnes Hui Chan; Richard A Games; Edwin L Key ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 576 KB
Characterising the Linear Complexity of
Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields
โœ Peter A. Hines ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

We give a complete resolution to a conjecture regarding the characterisation of linear complexities of span 1 de Bruijn sequences over nonprime finite fields. This contrasts with results for prime fields, where the characterisation is equivalent to an open question concerning permutation polynomials