X-code: MDS array codes with optimal encoding
From MaRDI portal
Publication:4701265
DOI10.1109/18.746809zbMATH Open0947.94028OpenAlexW2137291643MaRDI QIDQ4701265FDOQ4701265
Authors: Lihao Xu, Jehoshua Bruck
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b
Recommendations
Cited In (9)
- On encoding symbol degrees of array BP-XOR codes
- Fine-granularity loading schemes using adaptive Reed-Solomon coding for xDSL-DMT systems
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Additive codes with few weights
- X-code double parity array operation with two disk failures
- A new minimize matrix computation coding method for distributed storage systems
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
- Low-density MDS codes and factors of complete graphs
Uses Software
This page was built for publication: X-code: MDS array codes with optimal encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701265)