Capacity of the (1,infinity)-RLL Input-Constrained Erasure Channel with Feedback

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2015) Capacity of the (1,infinity)-RLL Input-Constrained Erasure Channel with Feedback. In: IEEE INFORMATION THEORY WORKSHOP (ITW), APR 26-MAY 01, 2015, Jerusalem, ISRAEL.

PDF IEEE_Inf_The_wor_2015.pdf - Published Version Restricted to Registered users only Download (249kB) | Request a copy

Abstract

The input-constrained erasure channel with feedback is considered, where the input sequence contains no consecutive 1's, i.e. the (1,infinity)-RLL constraint. The capacity is calculated using an equivalent dynamic program, which shows that the optimal average reward is equal to the capacity. The capacity can be expressed as C-epsilon = max(0) (<= p <= 1) H-b(p)/p+1/1-epsilon, where epsilon is the erasure probability and H-b(-) is the binary entropy. This capacity also serves as an upper bound on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.

Item Type:	Conference Proceedings
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	22 Oct 2016 09:01
Last Modified:	22 Oct 2016 09:01
URI:	http://eprints.iisc.ac.in/id/eprint/54965

Actions (login required)

View Item