New code parameters from reed-solomon subfield codes
Document Type
Article
Publication Date
12-1-1997
Abstract
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. © 1997 IEEE.
Publication Title
IEEE Transactions on Information Theory
Recommended Citation
Bierbrauer, J.,
&
Edel, Y.
(1997).
New code parameters from reed-solomon subfield codes.
IEEE Transactions on Information Theory,
43(3), 953-968.
http://doi.org/10.1109/18.568704
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10205