On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\mathbb{F}_{d}$
Information Theory
2019-04-11 v1 math.IT
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.
Cite
@article{arxiv.1904.05083,
title = {On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\mathbb{F}_{d}$},
author = {Minghui Yang and Jiejing Wen},
journal= {arXiv preprint arXiv:1904.05083},
year = {2019}
}
Comments
9