Sciweavers

103 search results - page 6 / 21
» Private Locally Decodable Codes
Sort
View
ECCC
2010
153views more  ECCC 2010»
13 years 2 months ago
Local list decoding with a constant number of queries
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
ICIP
2006
IEEE
14 years 9 months ago
Exploiting Spatial Redundancy in Pixel Domain Wyner-Ziv Video Coding
Distributed video coding is a recent paradigm that enables a flexible distribution of the computational complexity between the encoder and the decoder building on top of distribut...
Alan Trapanese, Catarina Brites, Fernando Pereira,...
ECCC
2006
116views more  ECCC 2006»
13 years 8 months ago
Uniform Hardness Amplification in NP via Monotone Codes
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...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
ICASSP
2011
IEEE
12 years 11 months ago
A classifier-based decoding approach for large scale distributed coding
Canonical distributed quantization schemes do not scale to large sensor networks due to the exponential decoder storage complexity that they entail. Prior efforts to tackle this i...
Kumar Viswanatha, Sharadh Ramaswamy, Ankur Saxena,...