Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computable Lower Bounds for Capacities of Input-Driven Finite-State
  Channels   This paper studies the capacities of input-driven finite-state channels,
i.e., channels whose current state is a time-invariant deterministic function
of the previous state and the current input. We lower bound the capacity of
such a channel using a dynamic programming formulation of a bound on the
maximum reverse directed information rate. We show that the dynamic
programming-based bounds can be simplified by solving the corresponding Bellman
equation explicitly. In particular, we provide analytical lower bounds on the
capacities of $(d, k)$-runlength-limited input-constrained binary symmetric and
binary erasure channels. Furthermore, we provide a single-letter lower bound
based on a class of input distributions with memory.

20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
25
The categories of this paper are: patt-sol
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat