An efficiently generated family of binary de Bruijn sequences
We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function f (x0,x1, ...xn-1) = x0 +x1 +xn-1 for n >_ 3, using the cycle joining method. Based on the properties of this class of LFSRs, we propose two new generic...
Saved in:
Main Authors: | Zhu, Yunlong, Chang, Zuling, Ezerman, Martianus Frederic, Wang, Qiang |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/146961 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Construction of de Bruijn sequences from product of two irreducible polynomials
by: Chang, Zuling, et al.
Published: (2017) -
On greedy algorithms for binary de Bruijn sequences
by: Chang, Zuling, et al.
Published: (2021) -
A new approach to determine the minimal polynomials of binary modified de Bruijn sequences
by: Musthofa, et al.
Published: (2022) -
On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
by: Chang, Zuling, et al.
Published: (2019) -
On The Pell Polynomials and The Pell Sequences in Groups
by: Ömür DEVECİ, et al.
Published: (2019)