On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\mathbb{F}_{d}$

Jiejing Wen; Minghui Yang

arxiv: 1904.05083 · v1 · pith:VTWER23Jnew · submitted 2019-04-10 · 💻 cs.IT · math.IT

On the k-error linear complexity of subsequences of d-ary Sidel'nikov sequences over prime field mathbb{F}_(d)

Minghui Yang , Jiejing Wen This is my paper

classification 💻 cs.IT math.IT

keywords complexityerrorlinearsequencesfieldmathbbnikovprime

0 comments

read the original abstract

We study the $k$-error linear complexity of subsequences of the $d$-ary Sidel'nikov sequences over the prime field $\mathbb{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.

This paper has not been read by Pith yet.

On the k-error linear complexity of subsequences of d-ary Sidel'nikov sequences over prime field mathbb{F}_(d)

discussion (0)