paper

On the -error linear complexity of subsequences of -ary Sidel'nikov sequences over prime field

arXiv:1904.05083

Abstract

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.

9