Sciweavers

534 search results - page 32 / 107
» One more bit is enough
Sort
View
EUROCRYPT
1997
Springer
13 years 11 months ago
Oblivious Transfers and Privacy Amplification
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
Gilles Brassard, Claude Crépeau
CIC
2006
101views Communications» more  CIC 2006»
13 years 9 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
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...
Shailendra Mishra, Nipur
TCOM
2008
84views more  TCOM 2008»
13 years 7 months ago
On the Performance of Closed-Loop Transmit Diversity with Noisy Channel Estimates and Finite-Depth Interleaved Convolutional Cod
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...
Jittra Jootar, James R. Zeidler, John G. Proakis
ERLANG
2007
ACM
13 years 12 months ago
Extended process registry for Erlang
The built-in process registry has proven to be an extremely useful feature of the Erlang language. It makes it easy to provide named services, which can be reached without knowing...
Ulf Wiger
FM
2006
Springer
127views Formal Methods» more  FM 2006»
13 years 11 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute