On tHe Size of Identifying Codes

Authors:
Uri Blass;Iiro S. Honkala;Simon Litsyn
Affiliations:
-;-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 2
Cited 0

Bounds on identifying codes

Discrete Mathematics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.