Perfect factors in the de Bruijn graph

DOI10.1007/BF01397666zbMath0814.05046OpenAlexW2001783445MaRDI QIDQ1345135

Kenneth G. Paterson

Publication date: 26 February 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01397666

zbMATH Keywords

digraphperfect mapde Bruijn grapharraydirected cyclesuniform directed 2-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

New classes of perfect maps. I ⋮ New classes of perfect maps. II ⋮ On the minimum linear complexity of de Bruijn sequences over non-prime finite fields ⋮ Linear difference equations and periodic sequences over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• On the de Bruijn torus problem
• Notes on de Bruijn sequences
• Toroidal tilings from de Bruijn-Good cyclic sequences
• Some VLSI decompositions of the de Bruijn graph
• Decoding perfect maps
• Constructing \(c\)-ary perfect factors
• On the complexities of de-Bruijn sequences
• A note on binary arrays with a certain window property (Corresp.)
• Construction of de Bruijn sequences of minimal complexity
• An algorithm for constructing m-ary de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• Constructions for perfect maps and pseudorandom arrays
• Perfect maps
• Shift-register synthesis and BCH decoding
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers