An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
From MaRDI portal
Publication:4701385
Recommendations
- An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
- An efficient algorithm for the generation of DeBruijn cycles
- Algorithms for the generation of full-length shift- register sequences
- An efficiently generated family of binary de Bruijn sequences
- scientific article; zbMATH DE number 2188425
Cited in
(11)- Generation of full cycles by a composition of NLFSRs
- A recursive construction of nonbinary de Bruijn sequences
- An efficient shift rule for the prefer-max de Bruijn sequence
- A multiple stream generator based on de Bruijn digraph homomorphisms
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- scientific article; zbMATH DE number 4106841 (Why is no real title available?)
- An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
- On extending de Bruijn sequences
- RRB vector: a practical general purpose immutable sequence
- Stretching de Bruijn sequences
- On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
This page was built for publication: An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701385)