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.
โฆ LIBER โฆ
Codes for Strong Identification
โ Scribed by Iiro Honkala; Tero Laihonen; Sanna Ranto
- Book ID
- 108497970
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 518 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Optimal Codes for Strong Identification
โ
Tero Laihonen
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 75 KB
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.
Codes of Practice for Identification
โ
Graham Davies; Tim Valentine
๐
Article
๐
1999
๐
Springer
โ 24 KB
Codes for Identification in the King Lat
โ
Iiro Honkala; Tero Laihonen
๐
Article
๐
2003
๐
Springer Japan
๐
English
โ 324 KB
Compact symmetrical binary codes for sys
โ
Ian A. Henderson; Joseph McGhee
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 535 KB
Protein patterns as codes for tumor iden
โ
David Irwin
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 568 KB
Particulate-fraction and soluble-fraction proteins from examples of breast carcinoma, Hodgkin's lympboma, and colon adenocarcinoma and their corresponding normal tissues were resolved on sodium dodecyl sulfate-polyacrylamide gels. The Coomassie blue-stained protein patterns were quantitated using a