406 search results - page 3 / 82 » Identifying Codes and Covering Problems |
VSTTE
2012
Springer
12 years 1 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
ACSD
1998
IEEE
13 years 10 months ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
DCC
2002
IEEE
13 years 5 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...