Cut-down de Bruijn sequences
From MaRDI portal
Publication:6635080
DOI10.1016/J.DISC.2024.114204MaRDI QIDQ6635080
Aysu Gündoğan, Ben Cameron, Joe Sawada
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Special sequences and polynomials (11B83) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A surprisingly simple de Bruijn sequence construction
- Symmetry types of periodic sequences
- Research problems on Gray codes and universal cycles
- An algorithm for generating shift-register cycles
- On the possibility, to travel around a graph without repetition and without cutting
- Feedback functions for generating cycles over a finite alphabet
- A framework for constructing de Bruijn sequences via simple successor rules
- Self-dual sequences
- Maximal state complexity and generalized de Bruijn words
- Ranking and unranking fixed-density necklaces and Lyndon words
- m-ary closed sequences
- Universal Cycles for Weight-Range Binary Strings
- Binary Ring Sequences
- An efficient algorithm for the generation of DeBruijn cycles
- A Simple Unpredictable Pseudo-Random Number Generator
- An algebraic construction for q-ary shift register sequences
- An Eulerian path approach to DNA fragment assembly
- Rates of DNA Sequence Profiles for Practical Values of Read Lengths
- Repeat-Free Codes
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
- Shift Register Sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- Magical Mathematics
- Arbitrary-length analogs to de Bruijn sequences
This page was built for publication: Cut-down de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635080)
