3898 search results - page 188 / 780 » On the Bit Extraction Problem |
115
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
142
click to vote
JACM
2006
15 years 3 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
121
click to vote
IJNSEC
2007
15 years 2 months ago
2007
To hide data in credentials is a key problem in information security. In this paper, a summary of the work on data hiding-capacity is made and several communication channel models...
CIC
2006
15 years 4 months ago
2006
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This is the second part of a two-part paper on optimal design of limited feedback single-user and multiuser spatial multiplexing systems. The first part of the paper studies the si...