Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...
—For the universal hypothesis testing problem, where the goal is to decide between the known null hypothesis distribution and some other unknown distribution, Hoeffding proposed ...
Jayakrishnan Unnikrishnan, Dayu Huang, Sean P. Mey...
—Maximization of the weighted sum-rate of secondary users (SUs) possibly equipped with multiantenna transmitters and receivers is considered in the context of cognitive radio (CR...
Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) G...
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...