1060 search results - page 22 / 212 » Notes on Coding Theory |
75
Voted
JSC
2010
15 years 22 days ago
2010
ICITS
2009
15 years 1 days ago
2009
115
click to vote
RSA
2006
15 years 2 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
ENTCS
2008
15 years 2 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
AML
2008
15 years 2 months ago
2008
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...