Technical Report CS0344

Title: On Cyclic MDS Codes of Length q Over GF(g)
Authors: Ron M. and Gadiel Seroussi
Abstract: It is shown that a cyclic code C of length q over GF(q) is MDS if and only if either i) q is a prime, in which case C is equivalent, up to a coordinate permutation, to an extended Reed-Solomon code, or ii) C is a trivial code of dimension k e {l,q-l,q}. Hence, there exists a non-trivial cyclic extended Reed-Solomon code of length q over GF(q) if and only if q is a prime.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1984
To the main CS technical reports page

Computer science department, Technion