Cyclic Lowest Density MDS Array Codes
Authors:
- 16 March 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (4) , 1721-1729
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.Keywords
This publication has 6 references indexed in Scilit:
- Lowest density MDS codes over extension alphabetsIEEE Transactions on Information Theory, 2006
- On lowest density MDS codesIEEE Transactions on Information Theory, 1999
- Low-density MDS codes and factors of complete graphsIEEE Transactions on Information Theory, 1999
- X-code: MDS array codes with optimal encodingIEEE Transactions on Information Theory, 1999
- Finite topologies and Hamiltonian pathsJournal of Combinatorial Theory, Series B, 1973
- Self-orthogonal quasi-cyclic codesIEEE Transactions on Information Theory, 1967