Theoretical Foundations of Applied Discrete Mathematics
Recovery of a polynomially complicated linear recurring sequence over Galois ring by its senior coordinate
E. M. Serebryakov
Maximal peroid linear recurring sequences (LRS) over a Galois ring, which are complicated with a polynomial over this ring, are considered. An algorithm is proposed for recovering the initial vector of a LRS by the senior coordinate of its complicated sequence.
LRS of maximal period, complicated polynomial, senior coordinate sequence, recovery of initial vector.
PDF file (659 kB)
E. M. Serebryakov, “Recovery of a polynomially complicated linear recurring sequence over Galois ring by its senior coordinate”, Prikl. Diskr. Mat., 2014, no. 2(24), 21–36
Citation in format AMSBIB
\paper Recovery of a~polynomially complicated linear recurring sequence over Galois ring by its senior coordinate
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|