60 search results - page 11 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
118
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
127
click to vote
ASIACRYPT
2001
Springer
15 years 5 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
101
click to vote
CODES
2006
IEEE
15 years 7 months ago
2006
IEEE
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
107
click to vote
DAC
2008
ACM
16 years 2 months ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
VTC
2007
IEEE
15 years 7 months ago
2007
IEEE
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...