Abstract
A systematic method is given for the realization of communication nets from their terminal capacity matrices. It is shown that this procedure results in a net whose total branch capacity is minimum for all nets satisfying the same terminal capacity matrix. It is also shown that when the terminal capacity matrix is indeterminate, then, for a given total branch capacity, the total terminal capacity is highest when all terminal capacities are made equal.
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.
