The number of completely different optimal identifying codes in the infinite square grid (Q2410258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of completely different optimal identifying codes in the infinite square grid |
scientific article; zbMATH DE number 6792140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of completely different optimal identifying codes in the infinite square grid |
scientific article; zbMATH DE number 6792140 |
Statements
The number of completely different optimal identifying codes in the infinite square grid (English)
0 references
17 October 2017
0 references
identifying code
0 references
difference
0 references
lattice
0 references
density
0 references
discrete geometry
0 references
0.8833321332931519
0 references
0.881790041923523
0 references
0.8594975471496582
0 references
0.8580319881439209
0 references
0.8448818922042847
0 references
