On binary codes for identification
β
Uri Blass; Iiro Honkala; Simon Litsyn
π
Article
π
2000
π
John Wiley and Sons
π
English
β 92 KB
A code C F n 2 is called t-identifying if the sets B t x C are all nonempty and different. Constructions of t-identifying codes are given.