Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels.

Binary-input memoryless channels with a run length constrained input are considered. Upper bounds to the capacity of such noisy run length constrained channels are derived using the dual capacity method with Markov test distributions satisfying the Karush-Kuhn-Tucker conditions for the capacity-achieving output distribution. Simplified algebraic characterizations of the bounds are presented for the binary erasure channel and the binary symmetric channel. These upper bounds are very close to achievable rates, and improve upon previously known feedback-based bounds for a large range of channel parameters. For the binary-input additive white Gaussian noise channel, the upper bound is simplified to a small-scale numerical optimization problem. These results provide some of the simplest upper bounds for an open capacity problem that has theoretical and practical relevance. [ABSTRACT FROM PUBLISHER]