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
Published in:
Information Theory, IEEE Transactions on
(Volume:35
,
Issue:
3
)
Date of Publication:
May 1989
- Page(s):
-
655
-
657
- ISSN :
-
0018-9448
- INSPEC Accession Number:
-
3476792
- Digital Object Identifier :
-
10.1109/18.30988
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
May 1989
- Sponsored by :
-
IEEE Information Theory Society