Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decoding Cyclic Codes up to a New Bound on the Minimum Distance   A new lower bound on the minimum distance of q-ary cyclic codes is proposed.
This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for
some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are
special cases of our bound. For some classes of codes the bound on the minimum
distance is refined. Furthermore, a quadratic-time decoding algorithm up to
this new bound is developed. The determination of the error locations is based
on the Euclidean Algorithm and a modified Chien search. The error evaluation is
done by solving a generalization of Forney's formula.

3
The categories of this paper are: physics
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph