A Caltech Library Service

Cyclic Low-Density MDS Array Codes

Cassuto, Yuval and Bruck, Jehoshua (2006) Cyclic Low-Density MDS Array Codes. In: 2006 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 2794-2798. ISBN 1-4244-0505-X.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We construct two infinite families of low density MDS array codes which are also cyclic. One of these families includes the first such sub-family with redundancy parameter r > 2. The two constructions have different algebraic formulations, though they both have the same indirect structure. First MDS codes that are not cyclic are constructed and then by applying a certain mapping to their parity check matrices, non-equivalent cyclic codes with the same distance and density properties are obtained. Using the same proof techniques, a third infinite family of quasi-cyclic codes can be constructed.

Item Type:Book Section
Related URLs:
URLURL TypeDescription ItemTechnical Report
Cassuto, Yuval0000-0001-6369-6699
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2006 IEEE. This work was supported in part by the Caltech Lee Center for Advanced Networking and by NSF grant ANI-0322475.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20170516-163950291
Persistent URL:
Official Citation:Y. Cassuto and J. Bruck, "Cyclic Low-Density MDS Array Codes," 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 2794-2798. doi: 10.1109/ISIT.2006.261571
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:77510
Deposited On:16 May 2017 23:57
Last Modified:15 Nov 2021 17:31

Repository Staff Only: item control page