About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On the capacity of a discrete, constant channel
Abstract
This paper is concerned with an iterative method for calculation of the capacity of a discrete, constant channel. Unlike the standard reference (Muroga 1953), in which Lagrange multipliers are used in the conventional form, the method described is based on techniques of mathematical programming. In addition, input signals of different duration are admitted. The algorithm proposed is very simple and has the advantage that it yields converging lower and uppper bounds for the capacity. © 1967 Academic Press Inc.