Technical Program

Paper Detail

Paper IDS.1.1
Paper Title Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
Authors V. Arvind Rameshwar, Navin Kashyap, Indian Institute of Science, India
Session S.1: Capacity Computation
Presentation Lecture
Track Shannon Theory
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract 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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!