ON THE OPTIMALITY OF ERROR CONTROL CODES DISCOVERED BY FARKAŠ AND BAYLIS
Recently new families of error control codes were discovered by
Farkas and Baylis. Some of them have higher rates than Reed
Solomon Codes with the same error control capability over
identical finite field. In this paper questions about optimality
of this codes are analyzed. It is observed that some of new codes
are, in a sense explained below, optimal.
Keywords: error control codes, code distance, erasure correcting, code rate, optimality