Computable Upper Bounds on the Capacity of Finite-State Channels.
Bashar HuleihelOron SabagHaim H. PermuterNavin KashyapShlomo Shamai ShitzPublished in: IEEE Trans. Inf. Theory (2021)
Keyphrases
- finite state
- upper bound
- markov chain
- lower bound
- model checking
- markov decision processes
- lower and upper bounds
- upper and lower bounds
- optimal policy
- sample complexity
- temporal logic
- efficiently computable
- tree automata
- continuous time bayesian networks
- dynamic programming
- objective function
- context free
- tight upper and lower bounds