60 search results - page 10 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
SIAMCOMP
2010
14 years 8 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
—Cooperative communications leverages the spatial diversity available in a wireless network enabling multiple radio nodes work together to improve the overall system performance....