Sciweavers

530 search results - page 32 / 106
» Bounds on marginal probability distributions
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 10 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
ASIACRYPT
2006
Springer
13 years 11 months ago
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
Satoshi Obana, Toshinori Araki
JCS
2008
93views more  JCS 2008»
13 years 8 months ago
On the Bayes risk in information-hiding protocols
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
ETT
2000
106views Education» more  ETT 2000»
13 years 7 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
IPL
2011
91views more  IPL 2011»
12 years 11 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...