Title :
Communication Systems of Channels with Bounded Nondecreasing Costs per Unit of Information Flow
Author_Institution :
University of California, Berkeley, CA
fDate :
3/1/1963 12:00:00 AM
Abstract :
Given a communication system of stations and capacitated channels in which there is associated with each channel a bounded nondecreasing cost per unit of information flow, flow patterns are found that maximize the information rate between a given pair of terminal stations at minimum over-all cost.
Keywords :
Channel capacity; Communication systems; Computer networks; Costs; Decoding; Friction; Information rates; Relays; Steady-state;
Journal_Title :
Communications Systems, IEEE Transactions on
DOI :
10.1109/TCOM.1963.1088723
