The analysis of de Bruijn sequences of non-extremal weight
From MaRDI portal
Publication:1584352
DOI10.1016/S0012-365X(98)00007-7zbMath0949.94002OpenAlexW2084419783MaRDI QIDQ1584352
Johannes Mykkeltveit, Erik R. Hauge
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00007-7
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (2)
On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences ⋮ Longest subsequences shared by two de Bruijn sequences
Cites Work
- Characterizations of generators for modified de Bruijn sequences
- On the cycles and adjacencies in the complementary circulating register
- On the classification of deBruijn sequences
- A proof of Golomb's conjecture for the de Bruijn graph
- Linear spans of modified de Bruijn sequences
- Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
This page was built for publication: The analysis of de Bruijn sequences of non-extremal weight