A new look at the de Bruijn graph
From MaRDI portal
Publication:1199424
DOI10.1016/0166-218X(92)90133-UzbMath0760.05047MaRDI QIDQ1199424
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Directed graphs (digraphs), tournaments (05C20)
Related Items
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ Metric dimension of directed graphs ⋮ A PDE Approach to the Prediction of a Binary Sequence with Advice from Two History‐Dependent Experts ⋮ Disordered ground states for classical discrete-state problems in one dimension.
Cites Work
- Unnamed Item
- Unnamed Item
- A class of nonlinear de Bruijn cycles
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- A proof of Golomb's conjecture for the de Bruijn graph
- On extremal factors of the de Bruijn graph
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- On the length of feedback shift registers
- Normal Recurring Decimals