Skip to main content
SpringerLink
Log in

Codes Identifying Sets of Vertices

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

Abstract

We consider identifying and strongly identifying codes. Finding faulty processors in a multiprocessor system gives the motivation for these codes. Constructions and lower bounds on these codes are given.We provide two infinite families of optimal (1,<= 2)-identifying codes, which can find malfunctioning processors in a binary hypercube F2 n

Also two infinite families of optimal codes are given in the corresponding case of strong identification. Some results on more general graphs are as well provided.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U. Blass, I. Honkala, S. Litsyn: Bounds on identifying codes. Discrete Math., to appear

    Google Scholar 

  2. U. Blass, I. Honkala, S. Litsyn: On binary codes for identification. J. Combin. Des., 8 (2000) 151–156

    Article  MATH  MathSciNet  Google Scholar 

  3. I. Charon, I. Honkala, O. Hudry, A. Lobstein: General bounds for identifying codes in some infinite regular graphs. Electronic Journal of Combinatorics, submitted

    Google Scholar 

  4. G. Cohen, I. Honkala, S. Litsyn, A. Lobstein: Covering Codes. Elsevier, Amsterdam, the Netherlands (1997)

    MATH  Google Scholar 

  5. G. Cohen, I. Honkala, A. Lobstein, G. Zémor: On identifying codes. In: Barg, A., Litsyn, S. (eds.): Codes and Association Schemes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56 (2001) 97–109

    Google Scholar 

  6. G. Exoo: Computational results on identifying t-codes. preprint

    Google Scholar 

  7. I. Honkala: On the identifying radius of codes. Proceedings of the Seventh Nordic Combinatorial Conference, Turku, (1999) 39–43

    Google Scholar 

  8. I. Honkala: Triple systems for identifying quadruples. Australasian J. Combinatorics, to appear

    Google Scholar 

  9. I. Honkala, T. Laihonen, S. Ranto: On codes identifying sets of vertices in Hamming spaces. Des. Codes Cryptogr., to appear

    Google Scholar 

  10. I. Honkala, T. Laihonen, S. Ranto: On strongly identifying codes. Discrete Math., to appear

    Google Scholar 

  11. I. Honkala, T. Laihonen, S. Ranto: Codes for strong identification. Electronic Notes in Discrete Mathematics, to appear

    Google Scholar 

  12. M.G. Karpovsky, K. Chakrabarty, L. B. Levitin, On a new class of codes for identifying vertices in graphs. IEEE Trans. Inform. Theory, 44 (1998) 599–611

    Article  MATH  MathSciNet  Google Scholar 

  13. T. Laihonen: Sequences of optimal identifying codes. IEEE Trans. Inform. Theory, submitted

    Google Scholar 

  14. T. Laihonen: Optimal codes for strong identification, European J. Combinatorics, submitted

    Google Scholar 

  15. T. Laihonen, S. Ranto: Families of optimal codes for strong identification. Discrete Appl. Math., to appear

    Google Scholar 

  16. S. Ranto, I. Honkala, T. Laihonen: Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inform. Theory, submitted

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, FIN-20014, Turku, Finland

    Tero Laihonen

  2. Turku Centre for Computer Science TUCS, University of Turku, FIN-20014, Turku, Finland

    Sanna Ranto

Authors
  1. Tero Laihonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanna Ranto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laihonen, T., Ranto, S. (2001). Codes Identifying Sets of Vertices. In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation