Sciweavers

290 search results - page 51 / 58
» Pseudorandom Bits for Polynomials
Sort
View
ICC
2007
IEEE
182views Communications» more  ICC 2007»
14 years 2 months ago
BER Analysis of MIMO-SVD Systems with Channel Estimation Error and Feedback Delay
— This paper analyzes the average bit error rate (BER) performance of singular value decomposition-based multiple-input multiple-output systems with channel estimation error and ...
Edward K. S. Au, Shi Jin, Matthew R. McKay, Wai Ho...
VTC
2007
IEEE
128views Communications» more  VTC 2007»
14 years 2 months ago
Performance of Space-Code-Division Multiple-Access Systems Using Reduced-Rank Detection
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
Jiliang Zhang, Lie-Liang Yang
FOCS
2006
IEEE
14 years 2 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
14 years 2 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 1 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous