Low-density MDS codes and factors of complete graphs
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (6), 1817-1826
- https://doi.org/10.1109/18.782102
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On lowest density MDS codesIEEE Transactions on Information Theory, 1999
- X-code: MDS array codes with optimal encodingIEEE Transactions on Information Theory, 1999
- MDS array codes with independent parity symbolsIEEE Transactions on Information Theory, 1996
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architecturesIEEE Transactions on Computers, 1995
- Phased burst error-correcting array codesIEEE Transactions on Information Theory, 1993
- New array codes for multiple phased burst correctionIEEE Transactions on Information Theory, 1993
- A survey of array error control codesEuropean Transactions on Telecommunications, 1992
- On the perfect one—factorization conjectureDiscrete Mathematics, 1992
- On perfect one-factorization of the complete graphK 2pGraphs and Combinatorics, 1989
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981