(FUNDAMENTAL AND APPLIED MATHEMATICS)

2011/2012, VOLUME 17, NUMBER 3, PAGES 5-23

## Skew linear recurring sequences of maximal period over Galois rings

M. A. Goltvanitsa
S. N. Zaitsev
A. A. Nechaev

Abstract

View as HTML     View as gif image

Let $p$ be a prime number, $R = GR\left(qd,pd\right)$ be a Galois ring of $qd= prd$ elements and of characteristic $pd$. Denote by $S = GR\left(qnd,pd\right)$ a Galois extension of the ring $R$ of dimension $n$ and by $\check S$ the ring of all linear transformations of the module RS. We call a sequence $v$ over the ring $S$ with the law of recursion $for all i\in \Nu \colon v\left(i+m\right)=\psi_\left\{m-1\right\} \left(v\left(i+m-1\right)\right) + \dots + \psi_0 \left(v\left(i\right)\right) , \psi _0, \dots ,\psi _\left\{m-1\right\} \in \check S$ (i.e., a linear recurring sequence of order $m$ over the module $\left\{\right\}_\left\{\check S\right\}S$) a skew LRS over $S$. It is known that the period $T\left(v\right)$ of such a sequence satisfies the inequality $T\left(v\right)$£ t = (qnm - 1)pd - 1. If $T\left(v\right) =$t, then we call $v$ a skew LRS of maximal period (a skew MP LRS) over $S$. A new general characterization of skew MP LRS in terms of coordinate sequences corresponding to some basis of a free module RS is given. A simple constructive method of building a big enough class of skew MP LRS is stated, and it is proved that the linear complexity of some of them (the rank of the linear recurring sequence) over the module SS is equal to $mn$, i.e., to the linear complexity over the module RS.

Location: http://mech.math.msu.su/~fpm/eng/k1112/k113/k11301h.htm