The Community for Technology Leaders
2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) (2005)
Yokohama, Japan
June 28, 2005 to July 1, 2005
ISBN: 0-7695-2282-3
pp: 326-335
Rebecca L. Collins , University of Tennessee
Adam L. Buchsbaum , AT&T Labs
Michael G. Thomason , University of Tennessee
James S. Plank , University of Tennessee
ABSTRACT
Erasure codes have profound uses in wide- and medium-area storage applications. While infinite-size codes have been developed with optimal properties, there remains a need to develop small codes with optimal properties. In this paper, we provide a framework for exploring very small codes, and we use this framework to derive optimal and near-optimal ones for discrete numbers of data bits and coding bits. These codes have heretofore been unknown and unpublished, and should be useful in practice. We also use our exploration to make observations about upper bounds for these codes, in order to gain a better understanding of them and to spur future derivations of larger, optimal and near-optimal codes.
INDEX TERMS
null
CITATION
Rebecca L. Collins, Adam L. Buchsbaum, Michael G. Thomason, James S. Plank, "Small Parity-Check Erasure Codes — Exploration and Observations", 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), vol. 00, no. , pp. 326-335, 2005, doi:10.1109/DSN.2005.86
109 ms
(Ver )