Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Linear Complexity of a Class of Binary Sequences With Optimal
  Autocorrelation   Binary sequences with optimal autocorrelation and large linear complexity
have important applications in cryptography and communications. Very recently,
a class of binary sequences of period $4p$ with optimal autocorrelation was
proposed via interleaving four suitable Ding-Helleseth-Lam sequences (Des.
Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where $p$ is an odd prime with
$p\equiv 1(\bmod~4)$. The objective of this paper is to determine the minimal
polynomial and the linear complexity of this class of binary optimal sequences
via sequence polynomial approach. It turns out that this class of sequences has
quite good linear complexity.

20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn