Published April 2009
| Published
Journal Article
Open
Cyclic lowest density MDS array codes
- Creators
-
Cassuto, Yuval
-
Bruck, Jehoshua
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.
Additional Information
© Copyright 2009 IEEE. Manuscript received August 21, 2007; revised March 13, 2008. Current version published March 18, 2009. This work was supported in part by the Caltech Lee Center for Advanced Networking. The material in this paper was presented in part at the IEEE International Symposium on Information Theory (ISIT), Seattle, WA, July 2006.Attached Files
Published - Cassuto2009p1349Ieee_T_Inform_Theory.pdf
Files
Cassuto2009p1349Ieee_T_Inform_Theory.pdf
Files
(254.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:be9cfb58b494d9bf8b704491620f650f
|
254.8 kB | Preview Download |
Additional details
- Eprint ID
- 14216
- Resolver ID
- CaltechAUTHORS:20090514-113712174
- Lee Center for Advanced Networking, Caltech
- Created
-
2009-08-13Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field