Constructing codes identifying sets of vertices (Q851780): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10623-006-0029-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968688591 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Codes identifying sets of vertices in random networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On codes identifying sets of vertices in Hamming spaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a new class of codes for identifying vertices in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two families of optimal identifying codes in binary Hamming spaces / rank | |||
Normal rank | |||
Latest revision as of 09:36, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing codes identifying sets of vertices |
scientific article |
Statements
Constructing codes identifying sets of vertices (English)
0 references
22 November 2006
0 references
Identifying codes
0 references
Fault detection
0 references
Code construction
0 references
