On extending de Bruijn sequences
type: Item
instance of: scholarly article
title: On extending de Bruijn sequences
zbMATH Open document ID: 1260.68311
author: Verónica Becher
author: Pablo Ariel Heiber
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6150465
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: de Bruijn sequences
zbMATH Keywords: word problems
Wikidata QID: Q61927025
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.013
OpenAlex ID: W2141215384
cites work: The origins of combinatorics on words
cites work: An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
cites work: The discrepancy of the lex-least de Bruijn sequence
cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
cites work: Strings with maximally many distinct subsequences and substrings
cites work: Normal Recurring Decimals
cites work: On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
cites work: Regular Sequences and Frequency Distributions
DOI: 10.1016/J.IPL.2011.06.013
Recommended article: Extending de Bruijn sequences to larger alphabets
Recommended article: DE BRUIJN SEQUENCES REVISITED
Recommended article: Q5740425
Recommended article: Stretching de Bruijn sequences
Recommended article: Notes on de Bruijn sequences
Recommended article: Q3686626
Recommended article: Q4800135
Recommended article: Computing generalized de Bruijn sequences
Recommended article: A generalized recursive construction for de Bruijn sequences
Recommended article: On the classification of deBruijn sequences
description: scientific article; zbMATH DE number 6150465