Homomorphisms of shift registers into linear automata
-
V. I. Solodovnikov
Abstract
The paper is devoted to describing all homomorphisms of shift registers over finite fields with feedback function which is a permutation function with respect to the input variable into linear automata. We prove that the linear automaton which is the homomorphic image of a shift register is always isomorphic to a linear shift register. Therefore, according to the theorem proved by the author earlier, the question on the homomorphisms of linear shift registers into linear automata reduces to the question on the decomposition of a function (or the polynomial representing the function) into the so-called shift-composition of two functions (polynomials), where the left function is an affine function. We also prove that any polynomial is uniquely representable in the form of a sum of shift-compositions of linear polynomials and monomials with the first variable. These linear polynomials are in correspondence with polynomials of one variable and the question on the decomposition is reduced to the search for the common divisors of these polynomials of one variable. We give some simple conditions sufficient for absence of nontrivial inner homomorphisms of shift registers into linear automata.
© de Gruyter 2008
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
