AbstractLet L(f) denote the space of all sequences of elements of a field F generated by the linear recurrence corresponding to the polynomial f over F. It is well known that if f1, f2,…,fm are polynomials over F none of which has multiple roots, then L(f1) L(f2) … L(fm) = L(h), where h is a polynomial whose roots are the distinct products a1a2…am, ai a root of fi. Here we find such an h in the general case
AbstractThe determination of the minimal polynomial, and thus of the linear complexity, of the produ...
AbstractGiven a finite field F and a linear recurrence relation over F it is possible to find, in a ...
A linear recurrence is a linear operator which maps rn into rn-1, where (rn) is a (recursive) sequen...
AbstractLet L(f) denote the space of all sequences of elements of a field F generated by the linear ...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
Let F be a field of nonzero characteristic, with its algebraic closure, F. For positive integers a, ...
AbstractBy using the techniques given by R. Güttfert and H. Niederreiter (Finite Fields Appl.1(1995)...
AbstractBy using the techniques given by R. Güttfert and H. Niederreiter (Finite Fields Appl.1(1995)...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
AbstractLet K be a Galois field and ƒ(D) = Dk − ak−1Dsuk−1− ⋯ minus;a0 be a monic polynomial over K,...
Abstract. Bousquet-Mélou and Petkovˇsek investigated the generating functions of multivariate linear...
Abstract. We consider a sequence (Gn) satisfying a stationary recurrence relation with a Perron domi...
AbstractLet F be a Galois field and k be a fixed positive integer. The set Γk(F) of all sequences ov...
AbstractThe determination of the minimal polynomial, and thus of the linear complexity, of the produ...
AbstractGiven a finite field F and a linear recurrence relation over F it is possible to find, in a ...
A linear recurrence is a linear operator which maps rn into rn-1, where (rn) is a (recursive) sequen...
AbstractLet L(f) denote the space of all sequences of elements of a field F generated by the linear ...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
Let F be a field of nonzero characteristic, with its algebraic closure, F. For positive integers a, ...
AbstractBy using the techniques given by R. Güttfert and H. Niederreiter (Finite Fields Appl.1(1995)...
AbstractBy using the techniques given by R. Güttfert and H. Niederreiter (Finite Fields Appl.1(1995)...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
AbstractLet K be a Galois field and ƒ(D) = Dk − ak−1Dsuk−1− ⋯ minus;a0 be a monic polynomial over K,...
Abstract. Bousquet-Mélou and Petkovˇsek investigated the generating functions of multivariate linear...
Abstract. We consider a sequence (Gn) satisfying a stationary recurrence relation with a Perron domi...
AbstractLet F be a Galois field and k be a fixed positive integer. The set Γk(F) of all sequences ov...
AbstractThe determination of the minimal polynomial, and thus of the linear complexity, of the produ...
AbstractGiven a finite field F and a linear recurrence relation over F it is possible to find, in a ...
A linear recurrence is a linear operator which maps rn into rn-1, where (rn) is a (recursive) sequen...