๐”– Bobbio Scriptorium
โœฆ   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

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
โœ 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.

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