Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Characterization of Graph-cover Pseudocodewords of Codes over $F_3$   Linear-programming pseudocodewords play a pivotal role in our understanding
of the linear-programming decoding algorithms. These pseudocodewords are known
to be equivalent to the graph-cover pseudocodewords. The latter
pseudocodewords, when viewed as points in the multidimensional Euclidean space,
lie inside a fundamental cone. This fundamental cone depends on the choice of a
parity-check matrix of a code, rather than on the choice of the code itself.
The cone does not depend on the channel, over which the code is employed. The
knowledge of the boundaries of the fundamental cone could help in studying
various properties of the pseudocodewords, such as their minimum pseudoweight,
pseudoredundancy of the codes, etc. For the binary codes, the full
characterization of the fundamental cone was derived by Koetter et al. However,
if the underlying alphabet is large, such characterization becom is more
involved. In this work, a characterization of the fundamental cone for codes
over $F_3$ is discussed.

37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg