On the GF(p) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences
From MaRDI portal
Publication:325285
Recommendations
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- On the linear complexity of Hall's sextic residue sequences
- Linear complexity of a class of pseudorandom sequences over a general finite field
- A generalization of the Hall's sextic residue sequences
- On the linear complexity of a new generalized cyclotomic sequence with length \({p^3}\) over \({\text{GF}}\left( l \right)\)
Cites work
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 1943094 (Why is no real title available?)
- Cyclic difference sets
- On the linear complexity of Hall's sextic residue sequences
- Several classes of binary sequences with three-level autocorrelation
- Shift-register synthesis and BCH decoding
- The CRC handbook of combinatorial designs
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- The sextic period polynomial
- The vulnerability of geometric sequences based on fields of odd characteristic
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
Cited in
(3)
This page was built for publication: On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325285)