On the k-error linear complexity of subsequences of d-ary Sidel'nikov sequences over prime field Fd
Abstract
We study the k-error linear complexity of subsequences of the d-ary Sidel'nikov sequences over the prime field Fd. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.