On the linear complexity of cascaded sequences

From MaRDI portal





[For the entire collection see Zbl 0578.00015.] The paper deals with infinite binary sequences \((c_ k)\) such that \(c_ k=a_ k\cdot b_{G(k)}\), for natural k, where \(G(0)=0\), \(G(k)=\sum_{i<k}a_ i\) and \((a_ i)\), \((b_ i)\) are sequences generated by shift registers corresponding to primitive polynomials of degree m. It has been proved that the lower bound of the degree of the minimal polynomial of \((c_ k)\) is equal to \(m(2^ m-1)\). Moreover, the problems of an improvement of the pseudo-noise properties of such sequences and the increase of their linear complexity, are considered.











This page was built for publication: On the linear complexity of cascaded sequences

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