Skip to main content
SpringerLink
Log in

Constructing codes identifying sets of vertices

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

For all t ≥  2, we give an explicit construction of an infinite family of graphs such that G admits a code identifying sets of at most t vertices of G of cardinality O(t 2 ln |V(G)|) for all members G of the family. This beats the best previously known explicit construction by a factor of t 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P Erdős (1932) ArticleTitleBeweis eines Satzes von Tschebyschef Acta Litterar Sci, Szeged 5 194–198

    Google Scholar 

  2. Frieze A, Martin R, Moncel J, Ruszinkó M, Smyth C Codes identifying sets of vertices in random networks, submitted.

  3. S Gravier J Moncel (2005) ArticleTitleConstruction of codes identifying sets of vertices in graphs Elect J Comb 12 R13 Occurrence Handle1060.05091 Occurrence Handle2134176

    MATH  MathSciNet  Google Scholar 

  4. I Honkala T Laihonen S Ranto (2001) ArticleTitleOn codes identifying sets of vertices in hamming spaces Designs, Codes Cryptogr 24 IssueID2 193–204 Occurrence Handle1008.94028 Occurrence Handle1850382 Occurrence Handle10.1023/A:1011256721935

    Article  MATH  MathSciNet  Google Scholar 

  5. FK Hwang V Sós (1987) ArticleTitleNon-adaptive hypergeometric group testing Studia Sci Mathemat Hung 22 IssueID1–4 257–263 Occurrence Handle0639.62076

    MATH  Google Scholar 

  6. MG Karpovsky K Chakrabarty LB Levitin (1998) ArticleTitleOn a new class of codes for identifying vertices in graphs IEEE Trans Inform Theory 44 IssueID2 599–611 Occurrence Handle1105.94342 Occurrence Handle1607726 Occurrence Handle10.1109/18.661507

    Article  MATH  MathSciNet  Google Scholar 

  7. T Laihonen S Ranto (2001) ArticleTitleCodes identifying sets of vertices Lecture Notes Comput Sci 2227 82–91 Occurrence Handle1057.94035 Occurrence Handle1913454 Occurrence Handle10.1007/3-540-45624-4_9

    Article  MATH  MathSciNet  Google Scholar 

  8. S Ranto I Honkala T Laihonen (2002) ArticleTitleTwo families of optimal identifying codes in binary Hamming spaces IEEE Trans Infor Theory 48 IssueID5 1200–1203 Occurrence Handle1061.94080 Occurrence Handle1907404 Occurrence Handle10.1109/18.995650

    Article  MATH  MathSciNet  Google Scholar 

  9. http://www.infres.enst.fr/~lobstein/debutBIBidetlocdom.ps

Download references

Author information

Authors and Affiliations

  1. ERTé “Maths à Modeler”, Groupe de Recherche GéoD, Laboratoire Leibniz, 46, avenue Félix Viallet, 38031, Grenoble Cedex, France

    Julien Moncel

Authors
  1. Julien Moncel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julien Moncel.

Additional information

Communicated by J.D. Key.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moncel, J. Constructing codes identifying sets of vertices. Des Codes Crypt 41, 23–31 (2006). https://doi.org/10.1007/s10623-006-0029-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0029-z

Keywords

Keywords

Search

Navigation