1953 search results - page 8 / 391 » codes 2010 |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and ...
ECCC
2010
14 years 9 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
CMS
2001
14 years 11 months ago
2001
ASE
2010
14 years 9 months ago
2010