Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
From MaRDI portal
Publication:2552957
DOI10.1016/0020-0255(68)90008-XzbMath0238.20060MaRDI QIDQ2552957
Publication date: 1968
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(68)90008-x
linear shift register sequences; group of unimodular transformations; polynomials with symmetries; roots of polynomials over Galois Field (2)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
11T22: Cyclotomy
Related Items
An extension of binary cyclotomic sequences having order 2lt, Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations, Crosscorrelation of \(m\)-sequences, exponential sums, bent functions and Jacobsthal sums, 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\), 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, О приближении дискретных функций линейными функциями, Obtaining Specified Irreducible Polynomials over Finite Fields
Cites Work
