Investigating the discrepancy property of de Bruijn sequences
From MaRDI portal
Publication:2075526
DOI10.1016/j.disc.2021.112780zbMath1493.68281arXiv2005.01638OpenAlexW3023517918MaRDI QIDQ2075526
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.01638
Related Items
Uses Software
Cites Work
- Unnamed Item
- Generalized Fibonacci recurrences and the lex-least de Bruijn sequence
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- A surprisingly simple de Bruijn sequence construction
- The discrepancy of the lex-least de Bruijn sequence
- Lexicographic compositions and de Bruijn sequences
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Constructing de Bruijn sequences by concatenating smaller universal cycles
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
- A framework for constructing de Bruijn sequences via simple successor rules
- Self-dual sequences
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions
- Character sums and nonlinear recurrence sequences
- The Grandmama de Bruijn Sequence for Binary Strings
- Universal Cycles for Weight-Range Binary Strings
- De Bruijn Sequences for Fixed-Weight Binary Strings
- A Simple Combinatorial Algorithm for de Bruijn Sequences
- An efficient algorithm for the generation of DeBruijn cycles
- A new algorithm for the generation of binary de Bruijn sequences
- A new memoryless algorithm for de Bruijn sequences
- On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Shift Register Sequences
- Shift-register synthesis and BCH decoding
