Preliminary results on the minimal polynomial of modified de Bruijn sequences
From MaRDI portal
Publication:1696767
DOI10.1016/j.ffa.2017.12.007zbMath1423.94043OpenAlexW2776951934MaRDI QIDQ1696767
Publication date: 15 February 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2017.12.007
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
The minimal polynomials of modified de Bruijn sequences revisited, New results on the minimal polynomials of modified de Bruijn sequences
Cites Work
- Unnamed Item
- Unnamed Item
- A recursive construction of nonbinary de Bruijn sequences
- Minimal polynomials of the modified de Bruijn sequences
- On the complexities of de-Bruijn sequences
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- A generalized recursive construction for de Bruijn sequences
- An efficient algorithm for the generation of DeBruijn cycles
- Construction of de Bruijn sequences of minimal complexity
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Linear spans of modified de Bruijn sequences
- On Zsigmondy primes
- Linear complexity of de Bruijn sequences-old and new results
- Randomness and Representation of Span n Sequences