On binary codes for identification

Uri Blass, Iiro Honkala, Simon Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

A code C ⊆ double-struck F sign2n is called t-identifying if the sets Bt(x) ∩ C are all nonempty and different. Constructions of t-identifying codes are given.

Original languageEnglish
Pages (from-to)151-156
Number of pages6
JournalJournal of Combinatorial Designs
Volume8
Issue number2
DOIs
StatePublished - 2000

Fingerprint

Dive into the research topics of 'On binary codes for identification'. Together they form a unique fingerprint.

Cite this