Representations over Z p n of linear recurring sequence of maximal period over GF( p )

From MaRDI portal
Publication:4272124





The best review of this paper is its introduction without its last sentence. ``Let \(u= (u(0), u(1),...)\) be a linear recurring sequence (LRS) of maximal period over the field \(P= GF(p)\), \(R= \mathbb{Z}_{p^ n}\) be a residue ring modulo \(p^ n\) (\(p\) is prime) and \(\sigma: P\to R\) be a map of the set \(P\) into the set \(R\). The sequence \(\sigma(u)\) over the ring \(R\) defined by \(\sigma(u) (i)= \sigma(u(i))\), \(i\geq 0\), is called a representation of the sequence \(u\) ovever the ring \(R\), or \(R\)- representation of \(u\). The map \(\sigma\) is also called a representation. Since \(u\) is a periodic sequence of period \(T\), \(\sigma(u)\) is periodic, and \(x^ T -e\) is a characteristic polynomial of \(\sigma(u)\). There may exist characteristic polynomials of \(\sigma(u)\) of degree less than \(T\). A characteristic polynomial of the least degree is called a minimal polynomial of \(\sigma(u)\). The rank of \(\sigma(u)\) is the degree of a minimal polynomial of \(\sigma(u)\), we denote it by rank \(\sigma(u)\). In this paper we obtain a description of all characteristic and minimal polynomials of \(\sigma(u)\) and give a formula for the rank of \(\sigma(u)\) over the ring \(R\). In particular, we describe the asymptotic behaviour of the rank \(\sigma(u)\). Let \(M\) be the rank of the LRS \(u\) over the field \(P\). If \(\sigma \not\equiv \text{const}\pmod p\), \(p\), \(n\) are fixed and \(M\to\infty\), then \[ \text{rank }\sigma(u)= \left( \begin{smallmatrix} M+t-1\\ t\end{smallmatrix} \right) \left( 1+O \left( {\textstyle {1\over M}}\right) \right) \sim {\textstyle {{M^ t} \over {t!}}}, \] where \(t= (p-1) (n-1)+ \ell (\sigma)\), \(1\leq \ell(\sigma)\leq p-1\). We also describe the representations \(\sigma\) such that rank \(\sigma(u)\) is maximal and minimal; for these representations \(\ell (\sigma)= p-1\) and \(\ell(\sigma) -1\), respectively. In the last section we apply these results to evaluation of the generator and check polynomials of the Reed-Muller code.











This page was built for publication: Representations over Z p n of linear recurring sequence of maximal period over GF( p )

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272124)