164 search results - page 23 / 33 » Linear Error Correcting Codes with Anytime Reliability |
148
Voted
IACR
2011
14 years 3 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 ...
150
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
160
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
149
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
146
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...