DocumentCode
1424857
Title
New code parameters from Reed-Solomon subfield codes
Author
Bierbrauer, Jürgen ; Edel, Yves
Author_Institution
Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA
Volume
43
Issue
3
fYear
1997
fDate
5/1/1997 12:00:00 AM
Firstpage
953
Lastpage
968
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
Keywords
Reed-Solomon codes; arrays; binary sequences; dual codes; linear codes; Reed-Solomon subfield codes; binary codes; code extensions; code lengthenings; code parameters; dual codes; minimal distance; orthogonal arrays; quaternary linear codes; subfield code dimensions; ternary codes; Application software; Databases; Interpolation; Lagrangian functions; Linear code; Polynomials; Reed-Solomon codes; Visualization;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.568704
Filename
568704
Link To Document