Title :
A construction of non-Reed-Solomon type MDS codes
Author :
Roth, Ron M. ; Lempel, A.
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa
fDate :
5/1/1989 12:00:00 AM
Abstract :
A construction is presented of long maximum-distance-separable (MDS) codes that are not generalized Reed-Solomon (GRS) type. The construction uses subsets S,|S|=m of a finite field F=GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [n=m+2, k=t+1] non-GRS MDS codes over F
Keywords :
codes; maximum distance separable codes; nonReed-Solomon type codes; Computer science; Equations; Galois fields; Linear code; Polynomials; Reed-Solomon codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
