scientific article; zbMATH DE number 1071799
The linear complexity of a sequence is defined as the length of the shortest linear feedback shift register that can generate the sequence. Then the \textit{linear complexity profile} of \((s_1,s_2,\dots)\) is the corresponding sequence \(L_1,L_2,\dots\) of values of the linear complexity of the sequences: \((s_1)\), \((s_1,s_2)\), \(\dots\). An infinite nonzero binary sequence \((s_1,s_2,\dots)\) is called a sequence with \textit{perfect spreading staircase profile} (or PSSP sequence) iff the subsequence of positive numbers in the sequence \(L_1(L_2-L_1)(L_3-L_2)\cdots\) is nondecreasing and at least one of its element is greater than 1. It has been shown that there exists a PSSP sequence with an even smaller density than that of the IYM sequence which is defined by the coefficients of the formal power series obtained by expanding the continued fraction \[ 1/(x+1/(x^2+1/(x^4+\cdots+1/(x^{2^k}+\cdots)\cdots))) \] and it has been shown the nonexistence of PSSP sequence with the smallest (or biggest) density. Next it has been proved that the (complementary) Hamming weight of PSSP sequences runs through every positive integer. At the end a generalization of IYM sequence is proposed as well as an example of such a PSSP sequence is given.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359115)
