Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels

11 Feb 2020 Rameshwar V. Arvind Kashyap Navin

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY