Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Algorithm for Computing $m$-Tight Error Linear Complexity of
  Sequences over $GF(p^{m})$ with Period $p^{m}$   The linear complexity (LC) of a sequence has been used as a convenient
measure of the randomness of a sequence. Based on the theories of linear
complexity, $k$-error linear complexity, the minimum error and the $k$-error
linear complexity profile, the notion of $m$-tight error linear complexity is
presented. An efficient algorithm for computing $m$-tight error linear
complexity is derived from the algorithm for computing $k$-error linear
complexity of sequences over GF($p^{m}$) with period $p^n$, where $p$ is a
prime. The validity of the algorithm is shown. The algorithm is also realized
with C language, and an example is presented to illustrate the algorithm.

26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess