DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click

HERE to register or log in.

# Accession Number:

## AD0601620

# Title:

## SYNTHESIS OF PROBABILISTIC COMMUNICATION NETS.

# Descriptive Note:

# Corporate Author:

## ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

# Report Date:

## 1964-05-01

# Pagination or Media Count:

##
56.0

# Abstract:

## In this thesis the necessary and sufficient conditions for an expected value terminal capacity matrix to be realized as a net with a tree structure are developed. There are two reasons for the constraint that the net have a tree structure. First, it is well known in the classical communication synthesis problem that if a realization exists, then a realization with a tree structure always exists. Secondly, since the path between two vertices in a tree is unique Fus equation for computing the expected value terminal capacity for these vertices reduces to a simple form. The expected value terminal capacity for vertices i and j in a tree net is the product of the edge probabilities in the path between vertices i and j multiplied by the edge weight which has the minimum value in that path. Author

# Distribution Statement:

## APPROVED FOR PUBLIC RELEASE

#