A1 Refereed original research article in a scientific journal
On binary codes for identification
Authors: Blass U, Honkala I, Litsyn S
Publisher: JOHN WILEY & SONS INC
Publication year: 2000
Journal: Journal of Combinatorial Designs
Journal name in source: JOURNAL OF COMBINATORIAL DESIGNS
Journal acronym: J COMB DES
Volume: 8
Issue: 2
First page : 151
Last page: 156
Number of pages: 6
ISSN: 1063-8539
DOI: https://doi.org/10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S
Abstract
A code C subset of or equal to F-2(n) is called t-identifying if the sets B-t(x) boolean AND C are all nonempty and different. Constructions of t-identifying codes are given. (C) 2000 John Wiley & Sons, Inc.
A code C subset of or equal to F-2(n) is called t-identifying if the sets B-t(x) boolean AND C are all nonempty and different. Constructions of t-identifying codes are given. (C) 2000 John Wiley & Sons, Inc.