Maximum distance separable codes based on circulant Cauchy matrices
From MaRDI portal
Recommendations
- On MDS codes via Cauchy matrices
- On generator matrices of MDS codes (Corresp.)
- MDS array codes with independent parity symbols
- New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
- New Efficient MDS Array Codes for RAID Part II: Rabin-Like Codes for Tolerating Multiple (greater than or equal to 4) Disk Failures
Cites work
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Faster integer multiplication
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- MDS array codes with independent parity symbols
- New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
- New Efficient MDS Array Codes for RAID Part II: Rabin-Like Codes for Tolerating Multiple (greater than or equal to 4) Disk Failures
- On lowest density MDS codes
- Polynomial Codes Over Certain Finite Fields
Cited in
(6)
This page was built for publication: Maximum distance separable codes based on circulant Cauchy matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868656)