A4 Article in conference proceedings
On the size of identifying codes




List of Authors: Blass U, Honkala I, Litsyn S
Publication year: 1999
Journal: Lecture Notes in Computer Science
Book title *: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 13th International Symposium AAECC-13
Journal name in source: APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, PROCEEDINGS
Journal acronym: LECT NOTES COMPUT SC
Volume number: 1719
Number of pages: 6
ISBN: 3-540-66723-7
ISSN: 0302-9743

Abstract
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.


Internal Authors/Editors


Research Areas


Last updated on 2019-14-06 at 12:51