MDS array codes with independent parity symbols
From MaRDI portal
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
(18)- Factorization of determinants over finite fields and application in stream ciphers
- Linear programming bounds for distributed storage codes
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
- Optimizing large data transfers in parity-declustered data layouts
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Recovering erasures by using MDS codes over extension alphabets
- Centralized key distribution protocol using the greatest common divisor method
- On encoding symbol degrees of array BP-XOR codes
- Cycle codes of graphs and MDS array codes
- Maximum distance separable codes based on circulant Cauchy matrices
- Irregular MDS Array Codes
- New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
- MDS array codes for correcting a single criss-cross error
- X-code: MDS array codes with optimal encoding
- Codes for Distributed Storage
- Additive codes with few weights
- Some optimal \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- Optimal array codes with hierarchical locality
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)
