IEEE Transactions on Information Theory 43 (1997), 953-968.
We determine the dimensions of subfield codes of Reed-Solomon codes and construct certain extensions and lengthenings of these codes. We start from the duals, using the language of orthogonal arrays. As a first result this allows us to obtain a fair number of improvements in the list of binary, ternary and quaternary linear codes with largest known minimal distance.
Download the preprint as pdf.
| home | List of publications |