On the size of identifying codes

Uri Blass, Iiro Honkala, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A code is called t-identifying if the sets B t (x) ∩ C are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length n are given.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings
EditorsMarc Fossorier, Shu Lin, Hideki Imai, Alain Poli
PublisherSpringer Verlag
Pages142-147
Number of pages6
ISBN (Print)3540667237, 9783540667230
DOIs
StatePublished - 1999
Event13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1999 - Honolulu, United States
Duration: 15 Nov 199919 Nov 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1719
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1999
Country/TerritoryUnited States
CityHonolulu
Period15/11/9919/11/99

Fingerprint

Dive into the research topics of 'On the size of identifying codes'. Together they form a unique fingerprint.

Cite this