Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4050837 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Graph theory
- On the complexities of de-Bruijn sequences
- On the distribution of de Bruijn sequences of given complexity
- On the distribution of de Bruijn sequences of low complexity
- Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Shift-register synthesis and BCH decoding
- Some VLSI decompositions of the de Bruijn graph
- There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
Cited in
(3)
This page was built for publication: Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380344)