Can I read 2020 IEEE International Symposium on Information Theory (ISIT) - Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels on EtoBox?

2020 IEEE International Symposium on Information Theory (ISIT) - Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels by Rameshwar, V. Arvind; Kashyap, Navin is a scholarly article available to read on EtoBox.

What is 2020 IEEE International Symposium on Information Theory (ISIT) - Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels about?

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.

Author

Rameshwar, V. Arvind; Kashyap, Navin

Publisher

IEEE

Published

2020

Language

EN