On Greedy Algorithms for Binary de Bruijn Sequences

DOI10.1007/S00200-020-00459-3MaRDI QIDQ6314496arXivFDO

Authors Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza

Publication date 23 February 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00200-020-00459-3

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

arXiv classification

cs.DScs.ITmath.COmath.IT

Abstract: We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) 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 new algorithm.

This page was built for publication: On Greedy Algorithms for Binary de Bruijn Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314496)