𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On binary codes for identification

✍ Scribed by Uri Blass; Iiro Honkala; Simon Litsyn


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
92 KB
Volume
8
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Optimal Codes for Strong Identification
✍ Tero Laihonen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 75 KB

Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, ≀ l)-identifying codes in Hamming spaces for every l when l β‰₯ 3.

On Identifying Codes in Binary Hamming S
✍ Iiro Honkala; Antoine Lobstein πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 138 KB

A binary code C f0; 1g n is called r-identifying, if the sets B r ðxÞ \ C; where B r ðxÞ is the set of all vectors within the Hamming distance r from x; are all nonempty and no two are the same. Denote by M r ðnÞ the minimum possible cardinality of a binary r-identifying code in f0; 1g n : We prove

Local Weight Enumerators for Binary Self
✍ Udo Ott πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 139 KB

Moreover, if 0 admits the (t, i)-design property for every i t, we say that 0 admits the t-design property.

Symbolic codes for multifrequency binary
✍ I.A. Henderson; J. McGhee πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 431 KB

AImtraet--Symbolic codes allow a simple description of binary test signals for the identification of control systems. These symbolic descriptions of digital shift keyed modulation using compact binary codes are highlighted as the basis for designing new multifrequency binary sequence (MBS) test sign