On the Size of Identifying Codes

A code is called t-identifying if the sets Bt(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.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Blass, Uri, Honkala, Iiro, Litsyn, Simon
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A code is called t-identifying if the sets Bt(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.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/3-540-46796-3_14