In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side inf...
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
—Page’s test is optimal for detecting a permanent change in distribution, in the sense that it minimizes the worst case average delay to detection given an average distance bet...
Chunming Han, Peter K. Willett 0002, Biao Chen, Do...
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...