On the \begin{document}$ k $\end{document} -error linear complexity for \begin{document}$ p^n $\end{document} -periodic binary sequences via hypercube theory

The linear complexity and the \begin{document}$ k $\end{document} -error linear complexity of a binary sequence are important security measures for the security of the key stream. By studying binary sequences with the minimum Hamming weight, a new tool, named as the hypercube theory, is developed for \begin{document}$ p^n $\end{document} -periodic binary sequences. In fact, the hypercube theory is based on a typical sequence decomposition and it is a very important tool for investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known algorithm for computing linear complexity and show that the linear complexity of the first hypercube in the decomposition is equal to the linear complexity of the original sequence. Second, based on such decomposition, we give a complete characterization for the first decrease of the linear complexity for a \begin{document}$ p^n $\end{document} -periodic binary sequence. This significantly improves the current existing results in literature. As to the importance of the hypercube, we finally derive a counting formula for the \begin{document}$ m $\end{document} -hypercubes with the same linear complexity.