Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences

DOI10.1016/0020-0255(68)90008-XzbMath0238.20060OpenAlexW1983818679MaRDI QIDQ2552957

Solomon W. Golomb

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

zbMATH Keywords

linear shift register sequencesgroup of unimodular transformationspolynomials with symmetriesroots of polynomials over Galois Field (2)

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cyclotomy (11T22)

Related Items

Obtaining Specified Irreducible Polynomials over Finite Fields, Irreducible factors of psi-polynomials over finite fields, 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, On the linear complexity of some new \(q\)-ary sequences, Trace representation of some generalized cyclotomic sequences of length \(pq\), 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}\), Some results about the cross-correlation function between two maximal linear sequences, Perfect nonlinear functions and cryptography, О приближении дискретных функций линейными функциями, Algebraic constructions for Costas arrays

Cites Work

• Weights of cyclic codes
• Unnamed Item
• Unnamed Item