New code parameters from Reed-Solomon subfield codes

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.

[1]  Philippe Delsarte,et al.  On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[2]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[3]  Tor Helleseth,et al.  New bounds on binary linear codes of dimension eight , 1987, IEEE Trans. Inf. Theory.

[4]  N. J. A. Sloane,et al.  New binary codes , 1972, IEEE Trans. Inf. Theory.

[5]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[6]  Tom Verhoeff,et al.  An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.