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

04/10/2019

∙

by   Minghui Yang, et al.

∙

0

∙

share

We study the k-error linear complexity of subsequences of the d-ary Sidel'nikov sequences over the prime field F_d. A general lower bound for the k-error linear complexity is given. For several special periods, we show that these sequences have large k-error linear complexity.