60 search results - page 7 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
132
click to vote
IACR
2011
14 years 1 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
106
click to vote
CCECE
2006
IEEE
15 years 7 months ago
2006
IEEE
The goal of this paper is to present a new recipe for the fractal image decoding process. In this paper, we explain how fractal-based methods can be internally combined with regul...
131
click to vote
FPGA
2006
ACM
15 years 5 months ago
2006
ACM
The development of Reed-Solomon (RS) codes has allowed for improved data transmission over a variety of communication media. Although Reed-Solomon decoding provides a powerful def...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
132
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...