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 ...

Reengineering is to reorganize and modify existing systems to enhance them or to make them more maintainable. Reengineering is usually necessary as systems evolve due to changes in requirements, technologies, and/or personnel. Design patterns capture recurring structures and dynamics among software participants to facilitate reuse of successful designs. Design patterns are common and well studi...

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...