On greedy algorithms for binary de Bruijn sequences

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

Full description

Saved in:
Bibliographic Details
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:
Science::Mathematics
de Bruijn Sequences
Greedy Algorithm
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
Description
Summary: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 sequences are particular cases of our algorithm.

Similar Items