60 search results - page 6 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
53
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we propose two types of new decoding algorithms for a network coding aided relaying (NCR) system, which adopts multiple antennas at both the transmitter and rece...
73
Voted
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
ECCC
2006
14 years 9 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
ICCSA
2009
Springer
15 years 4 months ago
2009
Springer
This paper proposes a hybrid hard/soft decode-and-forward (DF) relaying protocol with distributed turbo code (DTC), based on error detection in cooperative communications. In order...