Maximal period polynomials over Z/(p^ d)
This interesting paper contains a criterion for a polynomial \(f(x)\) with integer coefficients to have the maximal modulo \(p^ d\) period. The criterion involves the consideration of the discriminant and of the linear recurring sequences. The author invokes results of \textit{M. Ward} [Trans. Am. Math. Soc. 35, 600-628 (1933; Zbl 0007.24901)] and \textit{M. Hall} [Trans. Am. Math. Soc. 44, 196-218 (1938; Zbl 0019.19301)]. He also uses a criterion of primitiveness of polynomials over finite fields of \textit{Z. Dai} and \textit{M. Huang} [Chin. Sci. Bull. 36, 892-985 (1991; Zbl 0739.11055)]. The computation of the principal part of the discriminant is obtained. We notice that in the cases \(p=2,3,5\) or 7 the values of the principal part of the discriminant are explicitly given.
- A criterion for primitiveness of polynomials over \(\mathbb{Z}{}/(2^ d)\)
- Finding periods of Zhegalkin polynomials
- Periodic points classify a family of Markov shifts
- Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\)
- scientific article; zbMATH DE number 999576 (Why is no real title available?)
- On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
- Period distribution analysis of some linear maps
- Period distribution of generalized discrete Arnold cat map
- The nonlinear complexity of level sequences over Z/(4)
- Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\). II
This page was built for publication: Maximal period polynomials over \(\mathbb{Z}/(p^ d)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201600)
