We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Network coding increases throughput and is robust against failures and erasures. However, since it allows mixing of information within the network, a single corrupted packet genera...
This paper analyzes opportunistic schemes for transmission scheduling from one of n homogeneous queues whose channel states fluctuate independently. Considered schemes consist of ...
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...