About the k-Error Linear Complexity over $\mathbb{F}_p$ of sequences of length 2$p$ with optimal three-level autocorrelation
arXiv:1811.09581v1
Originality Synthesis-oriented
AI Analysis
This work addresses a specific problem in cryptography and coding theory for researchers focused on sequence design and security analysis, representing an incremental advancement in analyzing known sequence constructions.
The paper tackles the problem of determining the k-error linear complexity over finite fields for binary sequences of length 2p with optimal three-level autocorrelation, finding that these sequences exhibit high linear complexity and are robust against small errors.
We investigate the $k$-error linear complexity over $\mathbb{F}_p$ 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.