Asymptotically optimal erasure-resilient codes for large disk arrays.

DOI10.1016/S0166-218X(99)00228-0zbMath1050.68013OpenAlexW2159986814WikidataQ127185702 ScholiaQ127185702MaRDI QIDQ1972905

Yeow Meng Chee, Alan C. H. Ling, Charles J. Colbourn

Publication date: 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00228-0

zbMATH Keywords

reliabilitylarge disk arraysoptimal erasure-resilient codes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (max. 100)

Erasure-resilient codes from affine spaces ⋮ Combinatorial repairability for threshold schemes ⋮ Optimal and pessimal orderings of Steiner triple systems in disk arrays. ⋮ Rank inequalities and separation algorithms for packing designs and sparse triple systems. ⋮ Failed disk recovery in double erasure RAID arrays ⋮ Ladder orderings of pairs and RAID performance. ⋮ Nonexistence of sparse triple systems over abelian groups and involutions ⋮ Kirkman triple systems of order 21 with nontrivial automorphism group ⋮ Cluttered orderings for the complete bipartite graph ⋮ Recovering erasures by using MDS codes over extension alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coding techniques for handling failures in large disk arrays
• A few more RBIBDs with \(k=5\) and \(\lambda{}=1\)
• On Kirkman triple systems of order 33
• Anti-mitre Steiner triple systems
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A Class of Steiner Triple Systems of Order 21 and Associated Kirkman Systems
• Frames with Block Size Four
• The Structure of Certain Triple Systems
• Some new BIBDS with ? = 1 and 6 ?k ? 10
• Construction Techniques for Anti-Pasch Steiner Triple Systems
• Two new direct product‐type constructions for resolvable group‐divisible designs
• On coloring graphs to maximize the proportion of multicolored k-edges
• On the difference between consecutive primes

This page was built for publication: Asymptotically optimal erasure-resilient codes for large disk arrays.