On the size of identifying codes

: Blass U, Honkala I, Litsyn S

: Fossorier M, Imai H, Lin S, Poli A

: 1999

: Lecture Notes in Computer Science

: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 13th International Symposium AAECC-13

: APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, PROCEEDINGS

: LECT NOTES COMPUT SC

: 1719

: 142

: 147

: 6

: 3-540-66723-7

: 0302-9743

A code is called t-identifying if the sets B-t(x) boolean AND 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.

Mathematics