We investigate the k-error linear complexity over Fp of binary sequences of length 2p with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method presented by Ding et al.
@article{arxiv.1811.09581,
title = {About the k-Error Linear Complexity over $\mathbb{F}_p$ of sequences of length 2$p$ with optimal three-level autocorrelation},
author = {Vladimir Edemskiy},
journal= {arXiv preprint arXiv:1811.09581},
year = {2020}
}