๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal Codes for Strong Identification

โœ Scribed by Tero Laihonen

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
75 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

On binary codes for identification
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.

Identification of the optimal switching
Identification of the optimal switching for range-optimal atmospheric flight trajectories
โœ HANS SEYWALD ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 840 KB

The optimal switching structure associated with long-flight-time, range-optimal trajectories for a highperformance atmospheric flight vehicle is determined. The optimal solution, obtained from Pontryagin's minimum principle, consists of six arcs in total. Four arcs are riding the active dynamic pres

Coding-based schemes for fault identific
Coding-based schemes for fault identification in communication networks
โœ Chi-Chun Lo; Shing-Hong Chen; Bon-Yeh Lin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 239 KB ๐Ÿ‘ 2 views

This paper proposes two event correlation schemes for fault identification in communication networks. The causality graph model is used to describe the cause-and-effect relationships between network events.