|
This article is cited in 4 scientific papers (total in 4 papers)
Theoretical Foundations of Applied Discrete Mathematics
On the period length of vector sequences generated by polynomials modulo prime powers
N. G. Parvatov National Research Tomsk State University, Tomsk, Russia
Abstract:
We give an upper bound on the period length for vector sequences defined recursively by systems of multivariate polynomials with coefficients in the ring of integers modulo a prime power.
Keywords:
recurrence sequences, vector sequences, period length, polynomial functions, polynomial permutations, finite rings.
Citation:
N. G. Parvatov, “On the period length of vector sequences generated by polynomials modulo prime powers”, Prikl. Diskr. Mat., 2016, no. 1(31), 57–61
Linking options:
https://www.mathnet.ru/eng/pdm531 https://www.mathnet.ru/eng/pdm/y2016/i1/p57
|
Statistics & downloads: |
Abstract page: | 227 | Full-text PDF : | 84 | References: | 50 |
|