On the public citation graph

On Locating-Dominating Codes in Binary Hamming Spaces

0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1520-6610(2000)8:2<151::aid-jcd8>3.0.co;2-sopenalex-snapshot
On binary codes for identification
inferredcites →https://doi.org/10.1006/jcta.2002.3263openalex-snapshot
On Identifying Codes in Binary Hamming Spaces
inferredcites →https://doi.org/10.1007/3-540-45624-4_9openalex-snapshot
Codes Identifying Sets of Vertices
inferredcites →https://doi.org/10.1007/s00236-002-0093-4openalex-snapshot
On the complexity of the identification problem in Hamming spaces
inferredcites →https://doi.org/10.1016/s0012-365x(01)00113-3openalex-snapshot
Bounds on identifying codes
inferredcites →https://doi.org/10.1016/s0012-365x(01)00244-8openalex-snapshot
Fault-tolerant locating-dominating sets
inferredcites →https://doi.org/10.1016/s0304-3975(02)00536-4openalex-snapshot
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
inferredcites →https://doi.org/10.1023/a:1011256721935openalex-snapshot
On Codes Identifying Sets of Vertices in Hamming Spaces
inferredcites →https://doi.org/10.1090/dimacs/056/07openalex-snapshot
On identifying codes
inferredcites →https://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of codes
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1109/18.986043openalex-snapshot
Sequences of optimal identifying codes
inferredcites →https://doi.org/10.1109/18.995650openalex-snapshot
Two families of optimal identifying codes in binary Hamming spaces
inferredcites →https://doi.org/10.1109/tit.18openalex-snapshot
IEEE Transactions on Information Theory
inferredcites →https://doi.org/10.1109/tit.2002.800490openalex-snapshot
Identifying and locating-dominating codes: NP-completeness results for directed graphs
inferredcites →https://doi.org/10.1109/tit.2003.810657openalex-snapshot
Optimal linear identifying codes
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.37236/1451openalex-snapshot
New Bounds for Codes Identifying Vertices in Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20295openalex-snapshot
Liar's domination
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_17openalex-snapshot
On $$(1,\le l)$$-Locating-Dominating Codes in Infinite Triangular Grid
inferred← citeshttps://doi.org/10.1007/s10623-021-00963-8openalex-snapshot
Improved lower bound for locating-dominating codes in binary Hamming spaces
inferred← citeshttps://doi.org/10.1007/s10998-016-0121-8openalex-snapshot
Locating-dominating sets in hypergraphs
inferred← citeshttps://doi.org/10.1007/s11253-020-01846-2openalex-snapshot
Covering Codes of a Graph Associated with a Finite Vector Space
inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.008openalex-snapshot
Identifying codes and locating–dominating sets on paths and cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.027openalex-snapshot
Optimal (r,≤3) -locating–dominating codes in the infinite king grid
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.050openalex-snapshot
On regular and new types of codes for location-domination
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.004openalex-snapshot
Locating–dominating codes in paths
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.09.002openalex-snapshot
On locating–dominating sets in infinite grids
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.12.006openalex-snapshot
Locating sensors in paths and cycles: The case of 2-identifying codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.051openalex-snapshot
Locating-dominating sets of functigraphs
inferred← citeshttps://doi.org/10.1109/isit.2005.1523331openalex-snapshot
Disjoint identifying-codes for arbitrary graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.591.5d0openalex-snapshot
On global location-domination in graphs
inferred← citeshttps://doi.org/10.37394/23206.2022.21.24openalex-snapshot
Codes in the q-ary Lee Hypercube
inferred← citeshttps://doi.org/10.37863/umzh.v72i7.652openalex-snapshot
Covering codes of a graph associated to a finite vector space
inferred← citeshttps://doi.org/10.3934/amc.2012.6.27openalex-snapshot
On $(r,\leq 2)$-locating-dominating codes in the infinite king grid
inferred← citeshttps://doi.org/10.46298/dmtcs.8440openalex-snapshot
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0662openalex-snapshot
Locating-Dominating sets in Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.08537openalex-snapshot
Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
inferred← citeshttps://doi.org/10.7151/dmgt.2235openalex-snapshot
Open locating-dominating sets in circulant graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.