On greedy algorithms for binary de Bruijn sequences

DOI10.1007/S00200-020-00459-3OpenAlexW3093143888MaRDI QIDQ2081554

Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza

Publication date: 13 October 2022

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.08744

zbMATH Keywords

greedy algorithmde Bruijn sequencestate graphfeedback functionbinary periodic sequence

Mathematics Subject Classification ID

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

Related Items (1)

A relation between sequences generated by Golomb's preference algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spans of preference functions for de Bruijn sequences
• A surprisingly simple de Bruijn sequence construction
• A simple shift rule for \(k\)-ary de Bruijn sequences
• A class of nonlinear de Bruijn cycles
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• Algorithms for the generation of full-length shift- register sequences
• A new algorithm for the generation of binary de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
• A problem in arrangements
• Shift Register Sequences

This page was built for publication: On greedy algorithms for binary de Bruijn sequences