A family of optimal identifying codes in \(\mathbb Z^2\)
type: Item
instance of: scholarly article
title: A family of optimal identifying codes in \(\mathbb Z^2\)
zbMATH Open document ID: 1109.94008
published in: Journal of Combinatorial Theory. Series A
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 5078251
zbMATH Keywords: graph
zbMATH Keywords: density
author: Iiro Honkala
MaRDI profile type: Publication
full work available at URL: j.jcta.2006.03.011
OpenAlex ID: W2095154901
cites work: General bounds for identifying codes in some infinite regular graphs
cites work: Identifying codes with small radius in some infinite regular graphs
cites work: The minimum density of an identifying code in the king lattice.
cites work: An optimal edge-robust identifying code in the triangular lattice
cites work: On robust and dynamic identifying codes
cites work: On identifying codes in binary Hamming spaces
cites work: On a new class of codes for identifying vertices in graphs
cites work: Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
DOI: 10.1016/J.JCTA.2006.03.011
description: scientific article; zbMATH DE number 5078251