Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Asymptotic Optimality of Antidictionary Codes   An antidictionary code is a lossless compression algorithm using an
antidictionary which is a set of minimal words that do not occur as substrings
in an input string. The code was proposed by Crochemore et al. in 2000, and its
asymptotic optimality has been proved with respect to only a specific
information source, called balanced binary source that is a binary Markov
source in which a state transition occurs with probability 1/2 or 1. In this
paper, we prove the optimality of both static and dynamic antidictionary codes
with respect to a stationary ergodic Markov source on finite alphabet such that
a state transition occurs with probability $p (0 < p \leq 1)$.

9
The categories of this paper are: nlin
18
The categories of this paper are: econ
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom