Shift Register Sequences
NESL: A Nested Data-Parallel Language
NESL: A Nested Data-Parallel Language
Test Sequence Construction Using Minimum Information on the Tested System
Programming and Computing Software
On analysis and synthesis of (n, k)-non-linear feedback shift registers
Proceedings of the conference on Design, automation and test in Europe
Maximal-Period Sequences Generated by Feedback-Limited Nonlinear Shift Registers
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Decoding Color Structured Light Patterns with a Region Adjacency Graph
Proceedings of the 31st DAGM Symposium on Pattern Recognition
A transformation from the Fibonacci to the Galois NLFSRs
IEEE Transactions on Information Theory
Preliminary results on the adoption of De Bruijn binary sequences in DS-CDMA systems
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Belief propagation for improved color assessment in structured light
Proceedings of the 32nd DAGM conference on Pattern recognition
A recursive construction of nonbinary de Bruijn sequences
Designs, Codes and Cryptography
On extending de Bruijn sequences
Information Processing Letters
Hi-index | 15.04 |
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n驴 2 and 0 驴x