406 search results - page 1 / 82 » Identifying Codes and Covering Problems |
TIT
2008
13 years 4 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
TIT
1998
13 years 4 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
INTELLCOMM
2004
Springer
13 years 10 months ago
2004
Springer
We present the design, implementation and evaluation of a location detection system built over a Radio Frequency network based on the IEEE 802.11 standard. Our system employs beac...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
COMSUR
2011
12 years 4 months ago
2011
—This survey guides the reader through the extensive open literature that is covering the family of low-density paritycheck (LDPC) codes and their rateless relatives. In doing so...