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

A new memoryless algorithm for de Bruijn sequences

โœ Scribed by A Ralston

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
632 KB
Volume
2
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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
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

Polynomials and packings: A new proof of
Polynomials and packings: A new proof of de Bruijn's theorem
โœ Paul Boisen ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 119 KB

In 1969 de Bruijn published a proof of the following fact: An a x ab x abc brick can be used to pack an A x B x C box if, and only if, the integers A, B, C are in some order a multiple of a, a multiple of ab, and a multiple of abc. We give a quick proof of this result based on the following elementa