Abstract
N(T) satisfies an obvious difference equation, and most studies of the capacity of such a channel start from this equation. It is of some interest to get rid of the assumption of commensurability of the times of transmission as well as of the finiteness of the set of elementary symbols. In the following we shall show how the classical results can be generalized to this case. Let Si, * * * , S. . * be a finite or countable set of elementary symbols and let tn > 0 be the time of transmission of Sn (n = 1, 2, * * * . It is no longer assumed that the tn are commensurable, but we make the assumption that in the countable case, limn-. tn = oo* Without loss of generality we may assume 0 < t1 < t2 < .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
