Sciweavers

18 search results - page 2 / 4
» Sparse Random Linear Codes are Locally Decodable and Testabl...
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
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...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 11 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
14 years 2 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 9 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
ICIP
2008
IEEE
14 years 9 months ago
Localization of sparse image tampering via random projections
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....
Marco Tagliasacchi, Giuseppe Valenzise, Stefano Tu...