On binary codes for identification

: Blass U, Honkala I, Litsyn S

Publisher: JOHN WILEY & SONS INC

: 2000

: Journal of Combinatorial Designs

: JOURNAL OF COMBINATORIAL DESIGNS

: J COMB DES

: 8

: 2

: 151

: 156

: 6

: 1063-8539

DOI: https://doi.org/10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S

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.

Mathematics