Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences
From MaRDI portal
Publication:2552957
Recommendations
- scientific article; zbMATH DE number 566338
- scientific article; zbMATH DE number 1208719
- Algebraic Shift Register Sequences
- scientific article; zbMATH DE number 3422259
- Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)
Cites work
Cited in
(14)- Irreducible factors of psi-polynomials over finite fields
- Some results about the cross-correlation function between two maximal linear sequences
- The linear complexity of new generalized cyclotomic binary sequences of order four
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- Perfect nonlinear functions and cryptography
- On the approximation of discrete functions by linear functions
- Obtaining Specified Irreducible Polynomials over Finite Fields
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- An extension of binary cyclotomic sequences having order 2lt
- Crosscorrelation of m-sequences, exponential sums, bent functions and Jacobsthal sums
- Windmill polynomials over fields of characteristic two
- Algebraic constructions for Costas arrays
- On the linear complexity of some new q-ary sequences
- Trace representation of some generalized cyclotomic sequences of length pq
This page was built for publication: Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2552957)