ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2016) The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 62 (1). pp. 8-22.

[img] PDF
IEEE_Tra_Inf_The_62-1_8_2016.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TIT.2015.2495239


The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Keywords: Feedback capacity; constrained coding; dynamic programming; binary erasure channel; runlength-limited (RLL) constraints
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 03 Mar 2016 05:44
Last Modified: 03 Mar 2016 05:44
URI: http://eprints.iisc.ac.in/id/eprint/53366

Actions (login required)

View Item View Item