Maximum Distance Separable Codes Based on Circulant Cauchy Matrices

DOI10.1007/978-3-319-03578-9_28zbMath1350.94071OpenAlexW2157764600MaRDI QIDQ2868656

Christian Schindelhauer, Christian Ortolf

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_28

zbMATH Keywords

fault-tolerancestorageerasure codesRAID

Mathematics Subject Classification ID

Other types of codes (94B60) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices ⋮ Cauchy pairs and Cauchy matrices

Uses Software

• EVENODD

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial Codes Over Certain Finite Fields
• 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
• EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
• On lowest density MDS codes
• MDS array codes with independent parity symbols

This page was built for publication: Maximum Distance Separable Codes Based on Circulant Cauchy Matrices