On extending de Bruijn sequences

Authors:
Verónica Becher;Pablo Ariel Heiber
Affiliations:
Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón I, Ciudad Universitaria, (1428) Buenos Aires, Argentina;Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellón I, Ciudad Universitaria, (1428) Buenos Aires, Argentina
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 1

Generating De Bruijn Sequences: An Efficient Implementation

IEEE Transactions on Computers
The origins of combinatorics on words

European Journal of Combinatorics
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

IEEE Transactions on Computers
An efficient implementation of the D-homomorphism for generation of de Bruijn sequences

IEEE Transactions on Information Theory

A linearly computable measure of string complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a complete proof of the following theorem: Every de Bruijn sequence of order n in at least three symbols can be extended to a de Bruijn sequence of order n+1. Every de Bruijn sequence of order n in two symbols can not be extended to order n+1, but it can be extended to order n+2.