On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes (Q5317591)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2206268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes |
scientific article; zbMATH DE number 2206268 |
Statements
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes (English)
0 references
16 September 2005
0 references
optimal identifying codes
0 references
multiprocessor system
0 references
multiple covering
0 references
Hamming spaces
0 references
0.9111605
0 references
0.9085989
0 references
0.9040931
0 references
0.8804516
0 references
0 references
0.8760846
0 references
0.87313837
0 references
0.8728399
0 references
