Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array codes can be obtained via Balanced Incomplete Block Designs. We extend this technique for array codes that can tolerate an arbitrary number of disk failures via t-designs.
@article{arxiv.1209.6152,
title = {Parity Declustering for Fault-Tolerant Storage Systems via $t$-designs},
author = {Son Hoang Dau and Yan Jia and Chao Jin and Weiya Xi and Kheong Sann Chan},
journal= {arXiv preprint arXiv:1209.6152},
year = {2013}
}