Home Mathematics An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
Article
Licensed
Unlicensed Requires Authentication

An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence

  • D. N. Bylkov and A. A. Nechaev
Published/Copyright: January 7, 2011
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 20 Issue 5-6

Abstract

Let u be a linear recurring sequence of maximal period over the ring Zpn and 𝑣 be a pseudo-random sequence over the field Zp obtained by multiplying the highest coordinate sequence of u by some polynomial. In this paper we analyse possibilities and ways to restore u from a given 𝑣. A short survey of earlier results is given.

Received: 2010-09-01
Revised: 2010-11-04
Published Online: 2011-01-07
Published in Print: 2010-December

© de Gruyter 2010

Articles in the same Issue

  1. Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
  2. Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
  3. On conditional Internet graphs whose vertex degrees have no mathematical expectation
  4. An estimate of the probability of localisation of the diameter of a random scale-free graph
  5. On a recursive class of plateaued Boolean functions
  6. On the distribution of some characteristics of a quasimonotone mapping
  7. The expressibility problem in a lattice with closure operation
  8. An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
  9. The uniform id-decomposition of functions of many-valued logic over homogeneous functions
  10. The completeness problem in the function algebra of linear integer-coefficient polynomials
  11. Circuits for disjunction admitting short unitary diagnostic tests
  12. The group of automorphisms of the set of bent functions
  13. Complexity of multiplication in commutative group algebras over fields of prime characteristic
  14. The summation of Markov sequences on a finite abelian group
  15. The asymptotics of the number of repetition-free Boolean functions in the basis B1
https://doi.org/10.1515/dma.2010.036

Articles in the same Issue

  1. Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
  2. Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
  3. On conditional Internet graphs whose vertex degrees have no mathematical expectation
  4. An estimate of the probability of localisation of the diameter of a random scale-free graph
  5. On a recursive class of plateaued Boolean functions
  6. On the distribution of some characteristics of a quasimonotone mapping
  7. The expressibility problem in a lattice with closure operation
  8. An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
  9. The uniform id-decomposition of functions of many-valued logic over homogeneous functions
  10. The completeness problem in the function algebra of linear integer-coefficient polynomials
  11. Circuits for disjunction admitting short unitary diagnostic tests
  12. The group of automorphisms of the set of bent functions
  13. Complexity of multiplication in commutative group algebras over fields of prime characteristic
  14. The summation of Markov sequences on a finite abelian group
  15. The asymptotics of the number of repetition-free Boolean functions in the basis B1
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2026 De Gruyter Brill
Downloaded on 20.2.2026 from https://www.degruyterbrill.com/document/doi/10.1515/dma.2010.036/html
Scroll to top button