Improved Upper Bounds on Binary Identifying Codes

No abstract is available for this paper.

• Publication year

  2007

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2007-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2007.907434
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• New bounds on binary identifying codes

  2008cited by this paper
• Extremal cardinalities for identifying and locating-dominating codes in graphs

  2007cited by this paper
• Structural Properties of Twin-Free Graphs

  2007cited by this paper
• On robust and dynamic identifying codes

  2006cited by this paper
• Covering Codes

  2005cited by this paper
• Codes Identifiants dans les Graphes

  2005cited by this paper
• Robust location detection with sensor networks

  2004cited by this paper
• Optimal Codes for Strong Identification

  2002cited by this paper
• On Identifying Codes in Binary Hamming Spaces

  2002cited by this paper
• Bounds on identifying codes

  2001cited by this paper
• Linear Codes with Covering Radius and Codimension

  2001cited by this paper
• On binary codes for identification

  2000cited by this paper
• Two families of optimal identifying codes in binary Hamming spaces

  2000cited 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
• Some Problems and Results on Combinatorial Number Theory

  1989cited by this paper
• Further results on the covering radius of codes

  1986cited by this paper
• Les Invariants du n-cube

  1981cited by this paper

• On Iiro Honkala’s Contributions to Identifying Codes

  2024influential citation
• Codes in the q-ary Lee Hypercube

  2022cites this paper
• Locating-Domination and Identification

  2020cites 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
• Locating dominating codes: Bounds and extremal cardinalities

  2012cites this paper
• On binary linear r-identifying codes

  2011cites this paper
• New identifying codes in the binary Hamming space

  2010influential citation
• Improved bounds on identifying codes in binary Hamming spaces

  2010cites this paper
• Identifying Codes in q-ary Hypercubes

  2009cites this paper
• Upper bounds for binary identifying codes

  2009cites this paper
• New bounds on binary identifying codes

  2008cites this paper
• Constructions for identifying codes

  2008cites this paper
• Improved Identifying Codes in F2n

  2007cites this paper
• Discriminating and Identifying Codes in the Binary Hamming Space

  2007cites this paper
• Identifying and Locating- Dominating Codes in Binary Hamming Spaces

  2007cites this paper