Sciweavers

43 search results - page 3 / 9
» Tolerant Locally Testable Codes
Sort
View
AINA
2007
IEEE
15 years 3 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 6 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»
14 years 3 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
80
Voted
ECCC
2007
88views more  ECCC 2007»
14 years 11 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir