An algorithm for constructing m-ary de Bruijn sequences
From MaRDI portal
Publication:3756535
Recommendations
Cited in
(21)- Notes on de Bruijn sequences
- On stability of multi-valued nonlinear feedback shift registers
- An efficient shift rule for the prefer-max de Bruijn sequence
- scientific article; zbMATH DE number 221327 (Why is no real title available?)
- An Algebraic Construction of Sonar Sequences Using M-Sequences
- Perfect factors in the de Bruijn graph
- scientific article; zbMATH DE number 4081462 (Why is no real title available?)
- Constructing the first (and coolest) fixed-content universal cycle
- New classes of perfect maps. I
- Linearization of multi-valued nonlinear feedback shift registers
- An efficient algorithm for the generation of DeBruijn cycles
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- scientific article; zbMATH DE number 844162 (Why is no real title available?)
- scientific article; zbMATH DE number 1024022 (Why is no real title available?)
- Test sequence construction using minimum information on the tested system
- Cut-down de Bruijn sequences
- A recursive algorithm for generating \(k\)-ary de Bruijn sequences
- Construction of infinite de Bruijn arrays
- scientific article; zbMATH DE number 3880705 (Why is no real title available?)
- An algorithm for generating shift-register cycles
- A new algorithm of generating binary \(M\) sequences
This page was built for publication: An algorithm for constructing m-ary de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756535)