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

Oron Sabag, Haim H. Permuter, Navin Kashyap

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
DOIs
StatePublished - 24 Jun 2015
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: 26 Apr 20151 May 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference2015 IEEE Information Theory Workshop, ITW 2015
Country/TerritoryIsrael
CityJerusalem
Period26/04/151/05/15

Fingerprint

Dive into the research topics of 'Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback'. Together they form a unique fingerprint.

Cite this