On greedy algorithms for binary de Bruijn sequences
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequenc...
Saved in:
Main Authors: | Chang, Zuling, Ezerman, Martianus Frederic, Fahreza, Adamas Aqsa |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/146464 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An efficiently generated family of binary de Bruijn sequences
by: Zhu, Yunlong, et al.
Published: (2021) -
Construction of de Bruijn sequences from product of two irreducible polynomials
by: Chang, Zuling, et al.
Published: (2017) -
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) -
Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
by: Areerat Trongratsameethong, et al.
Published: (2012)