Vertex identifying codes for the n-dimensional lattice

From MaRDI portal
Publication:2906869

zbMATH Open1261.94040arXiv1008.4892MaRDI QIDQ2906869FDOQ2906869


Authors: Brendon Stanton Edit this on Wikidata


Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Abstract: An r-identifying code on a graph G is a set CsubsetV(G) such that for every vertex in V(G), the intersection of the radius-r closed neighborhood with C is nonempty and different. Here, we provide an overview on codes for the n-dimensional lattice, discussing the case of 1-identifying codes, constructing a sparse code for the 4-dimensional lattice as well as showing that for fixed n, the minimum density of an r-identifying code is Theta(1/rn1).


Full work available at URL: https://arxiv.org/abs/1008.4892




Recommendations




Cited In (5)





This page was built for publication: Vertex identifying codes for the \(n\)-dimensional lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906869)