Sciweavers

26 search results - page 3 / 6
» Locally Testable Cyclic Codes
Sort
View
90
Voted
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
AINA
2007
IEEE
15 years 1 months ago
Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame
In 1957 Crick hypothesized that the genetic code was a comma free code. This property would imply the existence of a universal coding frame and make the set of coding sequences a ...
Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 4 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...
83
Voted
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 1 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