Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
type: Item
instance of: scholarly article
title: Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
zbMATH Open document ID: 1030.05067
DOI: 10.1016/S0166-218X(02)00579-6
author: M. G. Karpovsky
author: Iiro Honkala
author: Simon Litsyn
published in: Discrete Applied Mathematics
publication date: 2003-09-09T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 1977907
zbMATH Keywords: closed walks
zbMATH Keywords: Lee metric
MaRDI profile type: Publication
cites work: Bounds on identifying codes
cites work: Q4948746
cites work: General bounds for identifying codes in some infinite regular graphs
cites work: The minimum density of an identifying code in the king lattice.
cites work: Identifying codes with small radius in some infinite regular graphs
cites work: Bounds for codes identifying vertices in the hexagonal grid
cites work: On codes identifying vertices in the two-dimensional square lattice with diagonals
cites work: On identifying codes
cites work: On codes identifying sets of vertices in Hamming spaces
cites work: On a new class of codes for identifying vertices in graphs
cites work: Sequences of optimal identifying codes
cites work: Families of optimal codes for strong identification
cites work: Two families of optimal identifying codes in binary Hamming spaces
cites work: Q4239067
description: scientific article; zbMATH DE number 1977907