Asymptotically optimal erasure-resilient codes for large disk arrays
- 15 May 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 102 (1-2) , 3-36
- https://doi.org/10.1016/s0166-218x(99)00228-0
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Construction Techniques for Anti-Pasch Steiner Triple SystemsJournal of the London Mathematical Society, 2000
- Coding techniques for handling failures in large disk arraysAlgorithmica, 1994
- RAID: high-performance, reliable secondary storageACM Computing Surveys, 1994
- Two new direct product-type constructions for resolvable group-divisible designsJournal of Combinatorial Designs, 1993
- Frames with Block Size FourCanadian Journal of Mathematics, 1992
- On Kirkman triple systems of order 33Discrete Mathematics, 1992
- A few more RBIBDs with k = 5 andλ = 1Discrete Mathematics, 1991
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- On the difference between consecutive primesJournal of Number Theory, 1986
- A class of Steiner triple systems of order 21 and associated Kirkman systemsMathematics of Computation, 1981