Homomorphisms of binary shift registers
Diskretnaya Matematika, Tome 17 (2005) no. 1, pp. 73-88
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider homomorphisms of binary shift registers with linear in the input
variable
feedback function, that is, homomorphisms of automata generating
binary linearly controlled complicated recurring sequences. It is proved that
any homomorphism of such register can be represented as a composition of a
homomorphism
into a register and a homomorphism close to an isomorphism.
In the description of this decomposition, the main role is played
by some operation which extends the operation of
multiplication of polynomials to the set of all binary functions.
The problem on homomorphism of a shift register is reduced to the problem of
searching common divisors of the feedback function and the output function.
@article{DM_2005_17_1_a6,
author = {V. I. Solodovnikov},
title = {Homomorphisms of binary shift registers},
journal = {Diskretnaya Matematika},
pages = {73--88},
publisher = {mathdoc},
volume = {17},
number = {1},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2005_17_1_a6/}
}
V. I. Solodovnikov. Homomorphisms of binary shift registers. Diskretnaya Matematika, Tome 17 (2005) no. 1, pp. 73-88. http://geodesic.mathdoc.fr/item/DM_2005_17_1_a6/