Cyclic lowest density MDS array codes

Authors:
Yuval Cassuto;Jehoshua Bruck
Affiliations:
Hitachi Global Storage Technologies, San Jose, CA and Department of Electrical Engineering, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering, California Institute of Technology, Pasadena, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 4
Cited 2

On lowest density MDS codes

IEEE Transactions on Information Theory
X-code: MDS array codes with optimal encoding

IEEE Transactions on Information Theory
Low-density MDS codes and factors of complete graphs

IEEE Transactions on Information Theory
Lowest density MDS codes over extension alphabets

IEEE Transactions on Information Theory

An erasure-resilient encoding system for flexible reading and writing in storage networks

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
What can coding theory do for storage systems?

ACM SIGACT News

Quantified Score

Hi-index	754.84

Visualization

Abstract

Three new families of lowest density maximum-distance separable (MDS) array codes are constructed, which are cyclic or quasi-cyclic. In addition to their optimal redundancy (MDS) and optimal update complexity (lowest density), the symmetry offered by the new codes can be utilized for simplified implementation in storage applications. The proof of the code properties has an indirect structure: first MDS codes that are not cyclic are constructed, and then transformed to cyclic codes by a minimum-distance preserving transformation.