Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast Algorithms for the Computation of the Minimum Distance of a Random
  Linear Code   The minimum distance of a code is an important concept in information theory.
Hence, computing the minimum distance of a code with a minimum computational
cost is a crucial process to many problems in this area. In this paper, we
present and evaluate a family of algorithms and implementations to compute the
minimum distance of a random linear code over $\mathbb{F}_{2}$ that are faster
than different current implementations. In addition to the basic sequential
implementations, we present parallel and vectorized implementations that render
high performances on modern architectures. The attained performance results
show the benefits of the developed optimized algorithms, which obtain
remarkable performance improvements compared with state-of-the-art
implementations widely used nowadays.

28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
6
The categories of this paper are: astro-ph
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg