Identifying and Locating- Dominating Codes in Binary Hamming Spaces

Published 2007 in Unknown venue

ABSTRACT

No abstract is available for this paper.

PUBLICATION RECORD

Publication year
2007
Venue
Unknown venue
Publication date
Unknown publication date
Fields of study
Mathematics, Computer Science
Identifiers
No identifiers available.
External record
Open on Semantic Scholar
Source metadata
Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

No claims are published for this paper.

CONCEPTS

No concepts are published for this paper.

REFERENCES

On a new class of identifying codes in graphs
2007cited by this paper
Improved Upper Bounds on Binary Identifying Codes
2007cited by this paper
Extremal cardinalities for identifying and locating-dominating codes in graphs
2007cited by this paper
On identifying codes that are robust against edge changes
2007cited by this paper
On robust and dynamic identifying codes
2006cited by this paper
Identifying Codes and the Set Cover Problem
2006cited by this paper
On locating-dominating sets in infinite grids
2006cited by this paper
Identifying codes of cycles
2006cited by this paper
Monotonicity of the minimum cardinality of an identifying code in the hypercube
2006cited by this paper
A linear algorithm for minimum 1-identifying codes in oriented trees
2006cited by this paper
An optimal locating-dominating set in the infinite triangular grid
2006cited by this paper
Constructing codes identifying sets of vertices
2006cited by this paper
1-identifying Codes on Trees
2005cited by this paper
On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes
2005cited by this paper
Discrete sensor placement problems in distribution networks
2005cited by this paper
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
2005cited by this paper
Disjoint identifying-codes for arbitrary graphs
2005cited by this paper
Covering Codes
2005cited by this paper
Robust location detection with sensor networks
2004cited by this paper
On identification in the triangular grid
2004cited by this paper
Identifying and locating-dominating codes on chains and cycles
2004cited by this paper
On identifying codes in the triangular and square grids
2004cited by this paper
On Locating-Dominating Codes in Binary Hamming Spaces
2004cited by this paper
The On-Line Encyclopedia of Integer Sequences
2003cited by this paper
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
2003cited by this paper
Optimal linear identifying codes
2003cited by this paper
Sequences of optimal identifying codes
2002cited by this paper
On strongly identifying codes
2002cited by this paper
Identifying and locating-dominating codes: NP-Completeness results for directed graphs
2002cited by this paper
On the complexity of the identification problem in Hamming spaces
2002cited by this paper
Families of optimal codes for strong identification
2002cited by this paper
On the Density of Identifying Codes in the Square Lattice
2002cited by this paper
Identifying Codes with Small Radius in Some Infinite Regular Graphs
2002cited by this paper
Optimal Codes for Strong Identification
2002cited by this paper
On Identifying Codes in Binary Hamming Spaces
2002cited by this paper
Fault-tolerant locating-dominating sets
2002cited by this paper
Codes for Strong Identification
2001cited by this paper
Linear Codes with Covering Radius and Codimension
2001cited by this paper
General Bounds for Identifying Codes in Some Infinite Regular Graphs
2001cited by this paper
Bounds on identifying codes
2001cited by this paper
Codes Identifying Sets of Vertices
2001cited by this paper
Two families of optimal identifying codes in binary Hamming spaces
2000cited by this paper
On binary codes for identification
2000cited by this paper
On Codes Identifying Sets of Vertices in Hamming Spaces
2000cited by this paper
On identifying codes
1999cited by this paper
New Bounds for Codes Identifying Vertices in Graphs
1999cited by this paper
On the Covering of Vertices for Fault Diagnosis in Hypercubes
1999cited by this paper
On a New Class of Codes for Identifying Vertices in Graphs
1998cited by this paper
Bounds for binary multiple covering codes
1993cited by this paper
Extremal graphs without three-cycles or four-cycles
1993cited by this paper
Some Problems and Results on Combinatorial Number Theory
1989cited by this paper
Domination and location in acyclic graphs
1987cited by this paper

CITED BY

Optimal Local Identifying and Local Locating-dominating Codes
2023cites this paper
Improved lower bound for locating-dominating codes in binary Hamming spaces
2021cites this paper
Constructions of r-identifying codes and (r, ≤ l)-identifying codes
2019cites this paper
Constructions of r-identifying codes and (r, ≤ l)-identifying codes
2019cites this paper
Scheduling dynamic dataflow graphs with model checking
2014cites this paper
Optimal (r, ≤3)-locating-dominating codes in the infinite king grid
2013cites this paper
On (r, ≤ 2)-locating-dominating codes in the infinite king grid
2012cites this paper
On Identifying and Locating-Dominating Codes in the Infinite King Grid
2012cites this paper
Identification de sommets dans les graphes
2012cites this paper
Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes)
2012cites this paper
Improved bounds on identifying codes in binary Hamming spaces
2010cites this paper
New identifying codes in the binary Hamming space
2010cites this paper
Discriminating and Identifying Codes in the Binary Hamming Space
2007cites this paper