About the k-Error Linear Complexity over Fp of sequences of length 2p with optimal three-level autocorrelation
Abstract
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.
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.