We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
The study of the class of new spatial multiplexing architectures (SMAs) is continued. As introduced in Part I of this paper, the SMAs consist of joint design of rate and power all...
Abstract-- In this paper, closed-form expressions for the uncoded bit error probability of closed-loop transmit diversity (CLTD) algorithms with two transmit and one receive antenn...
We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is...
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
( )1 The most common metric for evaluating the performance of an optical communications system is the symbol error probability (SEP) versus the received optical power. In circuit-l...
Stefano Galli, Ronald Menendez, Russel Fischer, Ro...
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
− In a clustered, multi-hop sensor network, a large number of inexpensive, geographically-distributed sensor nodes each use their observations of the environment to make local ha...