Computer Science – Information Theory
Scientific paper
2011-04-13
Computer Science
Information Theory
Submitted to Designs, Codes and Cryptography for peer review. 20 pages
Scientific paper
The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying connections between C-Codes (or quasi-C-Codes) and starters in group theory are revealed. It is shown that each C-Code (or quasi-C-Code) of length $2n$ can be constructed using an even starter (or even multi-starter) in $(Z_{2n},+)$. It is also shown that each C-Code (or quasi-C-Code) has a twin C-Code (or quasi-C-Code). Then, four infinite families (three of which are new) of C-Codes of length $p-1$ are constructed, where $p$ is a prime. Besides the family of length $p-1$, C-Codes for some sporadic even lengths are also presented. Even so, there are still some even lengths (such as 8) for which C-Codes do not exist. To cover this limitation, two infinite families (one of which is new) of quasi-C-Codes of length $2(p-1)$ are constructed for these even lengths.
Li Mingqiang
Shu Jiwu
No associations
LandOfFree
C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-219288