Lowest density MDS codes over extension alphabets

Authors:
E. Louidor;R. M. Roth
Affiliations:
Dept. of Math., British Columbia Univ., Vancouver, BC, Canada;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Cyclic lowest density MDS array codes

IEEE Transactions on Information Theory
T-code: 3-erasure longest lowest-density MDS codes

IEEE Journal on Selected Areas in Communications
What can coding theory do for storage systems?

ACM SIGACT News

Quantified Score

Hi-index	754.90

Visualization

Abstract

Let F be a finite field and b be a positive integer. A construction is presented of codes over the alphabet Fb with the following three properties: i) the codes are maximum-distance separable (MDS) over Fb, ii) they are linear over F, and iii) they have systematic generator and parity-check matrices over F with the smallest possible number of nonzero entries. Furthermore, for the case F=GF(2), the construction is the longest possible among all codes that satisfy properties i)-iii).