On the existence of balanced generalized de Bruijn sequences
From MaRDI portal
(Redirected from Publication:6098078)
Abstract: A balanced generalized de Bruijn sequence with parameters is a cyclic sequence of bits such that (a) the number of 0's equals the number of 1's, and (b) each substring of length occurs at most times. We determine necessary and sufficient conditions on , and for the existence of such a sequence.
Recommendations
- A generalized recursive construction for de Bruijn sequences
- scientific article; zbMATH DE number 2192127
- On generalized balancing sequences
- Computing generalized de Bruijn sequences
- On the distribution of de Bruijn sequences of given complexity
- The analysis of de Bruijn sequences of non-extremal weight
- On extending de Bruijn sequences
- An efficiently generated family of binary de Bruijn sequences
- Generalized de Bruijn cycles
- Notes on de Bruijn sequences
Cites work
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 46849 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Magical mathematics. The mathematical ideas that animate great magic tricks. With a foreword by Martin Gardner
Cited in
(3)
This page was built for publication: On the existence of balanced generalized de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098078)