A surprisingly simple de Bruijn sequence construction (Q501039)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A surprisingly simple de Bruijn sequence construction	scientific article

Statements

scholarly article

A surprisingly simple de Bruijn sequence construction (English)

zbMATH Open document ID

10.1016/j.disc.2015.08.002

Discrete Mathematics

publication date

8 October 2015

Mathematics Subject Classification ID

zbMATH DE Number

zbMATH Keywords

de Bruijn sequence

universal cycle

necklaces

shift gray code

CAT algorithm

generate

shift rule

successor rule

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.disc.2015.08.002

A Simple Combinatorial Algorithm for de Bruijn Sequences

Lexicographically least circular substrings

Algorithms for the generation of full-length shift- register sequences

Generation of the Ford sequence of length \(2^ n\), n large

A class of nonlinear de Bruijn cycles

Lexicographic compositions and de Bruijn sequences

Necklaces of beads in k colors and k-ary de Bruijn sequences

A new algorithm for the generation of binary de Bruijn sequences

A problem in arrangements

A new memoryless algorithm for de Bruijn sequences

De Bruijn Sequences for the Binary Strings with Maximum Density

Universal Cycles for Weight-Range Binary Strings

Sitelinks

Mathematics(1 entry)

mardi Publication:501039

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q501039&oldid=36205212"