加载中…
We study the -error linear complexity of subsequences of the -ary Sidel’nikov sequences over the prime field . A general lower bound for the -error linear complexity is given. For several special periods, we show that these sequences have large -error linear complexity.

生成讲解博客的中文版本

生成AI智能校验的中文版本