On the classification of deBruijn sequences

DOI10.1016/0012-365X(94)00265-KzbMath0843.05049OpenAlexW1991303196MaRDI QIDQ1910540

Erik R. Hauge, Johannes Mykkeltveit

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00265-k

zbMATH Keywords

classificationdeBruijn sequencedeBruijn graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (9)

The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ On the classification of deBruijn sequences ⋮ De Bruijn sequences, irreducible codes and cyclotomy ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ The adjacency graphs of some feedback shift registers ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ The analysis of de Bruijn sequences of non-extremal weight

Cites Work

• On the cycles and adjacencies in the complementary circulating register
• On the classification of deBruijn sequences
• A proof of Golomb's conjecture for the de Bruijn graph
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register

This page was built for publication: On the classification of deBruijn sequences