Author_Institution :
Inf. Syst. Lab., Stanford Univ., CA, USA
Abstract :
Consider a network of links where each link is erased intermittently with probability of erasure α. Erasures are independent of the transmitted information, and when a link is not erased it is characterized by p(y|x). We show for a certain family of networks that the capacity C˜ for the erasure network is given by C˜ = α~C, where C is the capacity of the network without erasures.
Keywords :
channel capacity; information theory; probability; telecommunication networks; discrete memoryless erasure channels; erasure channel capacity; erasure networks; network capacity; probability of erasure; Broadcasting; Channel capacity; Degradation; Electronic mail; Information systems; Laboratories; Mutual information;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023410
