By Topic

Probabilistic Communication Net as a Nonoriented Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Masayasu Ito ; Department of Electronic Engineering//Tokyo University of Agriculture and Technology//24-16, Nakamachi 2-chome, Koganeishi//Tokyo 184, Japan

This paper proves a necessary and sufficient realizability condition of the s-expected terminal capacity matrix of a probabilistic communication net. The proof is based on the successive reduction processes of a matrix, which provide a technique for designing a tree topology and determing edge capacities and reliabilities that satisfy the matrix.

Published in:

IEEE Transactions on Reliability  (Volume:R-24 ,  Issue: 3 )