2610 search results - page 100 / 522 » codes 2007 |
130
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
121
Voted
ECCC
2007
15 years 3 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
143
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
Considering that quincunx lattice is a more efficient spatial sampling scheme than square lattice, we investigate a new approach of image coding for quincunx sample arrangement. T...
100
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
124
Voted
SP
2007
IEEE
15 years 10 months ago
2007
IEEE
TCB Code Execution (Extended Abstract)∗ Jonathan M. McCune, Bryan Parno, Adrian Perrig, Michael K. Reiter, and Arvind Seshadri Carnegie Mellon University We propose an architect...