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 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
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
Moreover, if 0 admits the (t, i)-design property for every i t, we say that 0 admits the t-design property.
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