DocumentCode
2950316
Title
Cyclic Low-Density MDS Array Codes
Author
Cassuto, Yuval ; Bruck, Jehoshua
Author_Institution
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA
fYear
2006
fDate
9-14 July 2006
Firstpage
2794
Lastpage
2798
Abstract
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
Keywords
algebraic codes; matrix algebra; parity check codes; algebraic formulations; cyclic low-density MDS array codes; parity check matrices; quasi-cyclic codes; Bipartite graph; Circuits; Costs; Decoding; Encoding; Memory; Parity check codes; Protection; Reed-Solomon codes; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261571
Filename
4036482
Link To Document