Sciweavers

198 search results - page 14 / 40
» Source Codes as Random Number Generators
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
TIT
2008
164views more  TIT 2008»
14 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
CORR
2008
Springer
87views Education» more  CORR 2008»
14 years 9 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
99
Voted
DCC
1998
IEEE
15 years 1 months ago
Optimal Multiple Description Transform Coding of Gaussian Vectors
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...
Vivek K. Goyal, Jelena Kovacevic
84
Voted
CPHYSICS
2008
79views more  CPHYSICS 2008»
14 years 9 months ago
Atmospheric MUons from PArametric formulas: a fast GEnerator for neutrino telescopes (MUPAGE)
Abstract. Neutrino telescopes are opening new opportunities in observational high energy astrophysics. In these detectors, atmospheric muons from primary cosmic ray interactions in...
G. Carminati, M. Bazzotti, A. Margiotta, M. Spurio