Asymptotically optimal erasure-resilient codes for large disk arrays

Yeow Meng Chee, Charles Colbourn, Alan C H Ling

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.

Original languageEnglish (US)
Pages (from-to)3-36
Number of pages34
JournalDiscrete Applied Mathematics
Volume102
Issue number1-2
StatePublished - May 15 2000
Externally publishedYes

Fingerprint

Disk Array
Asymptotically Optimal
Combinatorial Design
Set Systems
Extremal Problems
Set Theory
Set theory
Finite Set
Exact Solution
Generalise

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Asymptotically optimal erasure-resilient codes for large disk arrays. / Chee, Yeow Meng; Colbourn, Charles; Ling, Alan C H.

In: Discrete Applied Mathematics, Vol. 102, No. 1-2, 15.05.2000, p. 3-36.

Research output: Contribution to journalArticle

Chee, Yeow Meng ; Colbourn, Charles ; Ling, Alan C H. / Asymptotically optimal erasure-resilient codes for large disk arrays. In: Discrete Applied Mathematics. 2000 ; Vol. 102, No. 1-2. pp. 3-36.
@article{d40a3d3d545a4180abe628cee985d46e,
title = "Asymptotically optimal erasure-resilient codes for large disk arrays",
abstract = "Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.",
author = "Chee, {Yeow Meng} and Charles Colbourn and Ling, {Alan C H}",
year = "2000",
month = "5",
day = "15",
language = "English (US)",
volume = "102",
pages = "3--36",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Asymptotically optimal erasure-resilient codes for large disk arrays

AU - Chee, Yeow Meng

AU - Colbourn, Charles

AU - Ling, Alan C H

PY - 2000/5/15

Y1 - 2000/5/15

N2 - Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.

AB - Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.

UR - http://www.scopus.com/inward/record.url?scp=0003095851&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0003095851&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0003095851

VL - 102

SP - 3

EP - 36

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-2

ER -