Locally repairable codes, or locally recoverable codes (LRC for short) are designed application in distributed and cloud storage systems. Similar to the classical block there is an important bound called Singleton-type codes. In this paper, optimal code refers a achieving bound. Like MDS (maximum distance separable) have some very nice combinatorial structures. Since introduction of people put ...

In this investigation, the explicit expressions for reliability function and mean time to failure (MTTF) of a repairable system with provision of spares and removable multi-repair facility have been established. In removable repairmen strategy, the repairmen turn on when there are N or more than N failed units and turn-off when system is empty. The failure times of operating/spare units and rep...

In this paper, we propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storag...

The amount of information available on the Web grows at an incredible high rate. Systems and procedures devised to extract these data from Web sources already exist, and different approaches and techniques have been investigated during the last years. On the one hand, reliable solutions should provide robust algorithms of Web data mining which could automatically face possible malfunctioning or...