TY - GEN

T1 - Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback

AU - Sabag, Oron

AU - Permuter, Haim H.

AU - Kashyap, Navin

N1 - Publisher Copyright:
© 2015 IEEE.

PY - 2015/6/24

Y1 - 2015/6/24

N2 - The input-constrained erasure channel with feedback is considered, where the input sequence contains no consecutive 1's, i.e. the (1, ∞)-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ε=max0≤p≤1 Hb(p)/p+1/1-ε, where ε is the erasure probability and Hb(·) 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.

AB - The input-constrained erasure channel with feedback is considered, where the input sequence contains no consecutive 1's, i.e. the (1, ∞)-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ε=max0≤p≤1 Hb(p)/p+1/1-ε, where ε is the erasure probability and Hb(·) 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.

UR - http://www.scopus.com/inward/record.url?scp=84938909150&partnerID=8YFLogxK

U2 - 10.1109/ITW.2015.7133107

DO - 10.1109/ITW.2015.7133107

M3 - Conference contribution

AN - SCOPUS:84938909150

T3 - 2015 IEEE Information Theory Workshop, ITW 2015

BT - 2015 IEEE Information Theory Workshop, ITW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 IEEE Information Theory Workshop, ITW 2015

Y2 - 26 April 2015 through 1 May 2015

ER -