An Efficiently Generated Family of Binary de Bruijn Sequences

03/20/2020
by   Yunlong Zhu, et al.
0

We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with characteristic polynomial f(x)=x^n+x^n-1+x+1 ∈F_2[x], for n ≥ 3, using the cycle joining method. Based on the properties of this class of LFSRs, we propose two classes of successor rules, each of which generates O(2^n-3) de Bruijn sequences. The cost to produce the next bit is O(n) time and O(n) space for a fixed n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2019

General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences

We put forward new general criteria to design successor rules that gener...
research
11/24/2020

The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure

The autocorrelation values of two classes of binary sequences are shown ...
research
04/21/2020

A Graph Joining Greedy Approach to Binary de Bruijn Sequences

Using greedy algorithms to generate de Bruijn sequences is a classical a...
research
11/28/2017

Sampling Markov Models under Constraints: Complexity Results for Binary Equalities and Grammar Membership

We aim at enforcing hard constraints to impose a global structure on seq...
research
04/14/2022

Wave-like behaviour in (0,1) binary sequences

This work presents a comprehensive study of the properties of finite (0,...
research
02/03/2022

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic binary ...
research
02/23/2019

On Greedy Algorithms for Binary de Bruijn Sequences

We propose a general greedy algorithm for binary de Bruijn sequences, ca...

Please sign up or login with your details

Forgot password? Click here to reset