MDS array codes with independent parity symbols
From MaRDI portal
Publication:4885683
Recommendations
- X-code: MDS array codes with optimal encoding
- MDS array codes for correcting a single criss-cross error
- New Efficient MDS Array Codes for RAID Part II: Rabin-Like Codes for Tolerating Multiple (greater than or equal to 4) Disk Failures
- New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
- A class of array codes correcting multiple column erasures
Cited in
(15)- Codes for Distributed Storage
- Recovering erasures by using MDS codes over extension alphabets
- On encoding symbol degrees of array BP-XOR codes
- MDS array codes for correcting a single criss-cross error
- Maximum distance separable codes based on circulant Cauchy matrices
- Centralized key distribution protocol using the greatest common divisor method
- Optimizing large data transfers in parity-declustered data layouts
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Factorization of determinants over finite fields and application in stream ciphers
- Additive codes with few weights
- Irregular MDS Array Codes
- Linear programming bounds for distributed storage codes
- Cycle codes of graphs and MDS array codes
- New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
This page was built for publication: MDS array codes with independent parity symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885683)
