Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS co...

This paper presents the on-going activities on the design of a Built-In-Self-Repairable micro-processor for high dependable environments. The processoc designed to pegorm SlSD instructions, is able to on-line dynamically reconfigure its internal micro-code in order to “emulate” faulty functional blocks using fault-free blocks of the system only. One of the main novelties of our approach is ther...

conclusions: this study detected multiple drug resistance in pseudomonas aeruginosa including resistance to β-lactams, aminoglycosides, and fluoroquinolones. therefore, identification of drug resistance patterns in p. aeruginosa and detection of pan-resistant producing isolates are of great importance in prevention and control of infections in burn center ward. background: serious infections by...

Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [14], several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in [14] are upper bounded by the code alphabet...

This paper analyzes a system subject to repairable and non-repairable failures. Non-repairable failures lead to replacement of the system. Repairable failures, first lead to repair but they lead to replacement after a fixed number of repairs. Operating and repair times follow phase type distributions (PH-distributions) and the pattern of the operating times is modelled by a geometric process. I...