This research examines the problem of maximizing the total information transfer when data are transmitted through a series of noisy channels. This is a common situation in communication networks. The key information-theoretic fact is that the overall capacity is strongly dependent on the order in which the individual channels are arranged. A number of interesting and tractable problems are formulated and investigated; some counter-intuitive results are suggested and will be evaluated.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9105832
Program Officer
Aubrey M. Bush
Project Start
Project End
Budget Start
1991-08-01
Budget End
1995-07-31
Support Year
Fiscal Year
1991
Total Cost
$258,347
Indirect Cost
Name
University of Michigan Ann Arbor
Department
Type
DUNS #
City
Ann Arbor
State
MI
Country
United States
Zip Code
48109