We generalize the idea of constructing codes over a finite field Fqby evaluating a certain collection of polynomials at elements of an extension field of Fq. Our approach for extensions of arbitrary degrees is different from the method in [3]. We make use of a normal element and circular permutations to construct polynomials over the intermediate extension field between Fqand F$_{q^{t}}$denoted by F$_{q^{s}}$where s divides t. It turns out that many codes with the best parameters can be obtained by our construction and improve the parameters of Brouwer’s table [1]. Some codes we get are optimal by the Griesmer bound.
[1]
Chaoping Xing,et al.
A class of linear codes with good parameters
,
2000,
IEEE Trans. Inf. Theory.
[2]
Li Chao.
Construction of A Class of Linear Codes with Good Parameters
,
2003
.
[3]
F. MacWilliams,et al.
The Theory of Error-Correcting Codes
,
1977
.
[4]
Rudolf Lide,et al.
Finite fields
,
1983
.
[5]
J. H. van Lint,et al.
Introduction to Coding Theory
,
1982
.
[6]
H. Niederreiter,et al.
Symmetric Polynomials and Some Good Codes
,
2001
.