SOME REMARKS ON THE CAPACITY OF A COMMUNICATION CHANNEL
One of the most important and well-known theorems in information theory is the capacity theorem (Theorem 1) of a discrete. memory less and regular channel. Another is the matching theorem (Theorem 3) about the information systems with symbols possessing time-durations. Although the two are seemingly irrelevant to each other, a close connection between them will be shown in Section 2 by presenting a general theorem which includes the two theorems as the two special cases. In Section I an interpretation of the capacity theorem is given by introduing the cost consideration into the information system. Information theory in its communication-engineering sense, the author thinks, consists of the two main branches, coding theory and information transmission theory. As to the former we do not know any example of applications to operations research problems. But as to the latter, Professor Kunisawa of Tokyo Institute of Technology has devoted his efforts in these several years to the exploration of both the theory and case studies [2]. The present note will be a little and further contribution along this line.