Generalized Bounds on the Capacity of the Binary-Input Channels

TL;DR

This paper establishes tight bounds on the capacity of general binary-input channels, extending symmetric channel results to more general cases using the Bhattacharyya parameter.

Contribution

It generalizes existing capacity bounds from symmetric to all binary-input memoryless channels by leveraging the Bhattacharyya parameter.

Findings

Bounds are tight for a broad class of channels.

Symmetric channel bounds are valid for non-symmetric channels.

Provides a unified approach to channel capacity estimation.

Abstract

For the class of the memoryless binary-input channels which are not necessarily symmetric, we derive tight bounds on the capacity in terms of the Bhattacharyya parameter. As it turns out, the bounds derived under the symmetric channel assumption in [1] are valid for the general case as well.