A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions

Abstract

In this paper, we give a new upper bound on sizes of linear codes related to weight distributions of codes as follows. Let C be a linear $[n,k,d]_{q}$ code, such that, between d and $d\left ({{1+\frac {1}{q-1}}}\right)-1$ , the largest weight of codewords in C is the weight $d\left ({{1+\frac {1}{q-1}}}\right)-1-v$ , then $k \leq n-d\left ({{1+\frac {1}{q-1}}}\right)+2+v$ . Some infinite families of linear codes with arbitrary minimum distances attaining this bound are constructed. This bound is stronger than the Singleton bound for linear codes. Hence we prove that there is no codeword of weights in the range $\left [{{\frac {qd}{q-1}-v,\frac {qd}{q-1}-1}}\right]$ for a linear $[n,k,d]_{q}$ code, if $v=\frac {qd}{q-1}+k-n-2 \geq 2$ . This is the first such kind of result, which concludes vanishing partial weight distributions from four parameters $n,k,d$ and q. Then we give vanishing partial weight distribution results for many best known linear codes, some almost MDS codes, general small Griesmer defect codes, some BCH codes, and some cyclic codes. Upper bounds on the number of nonzero weights of binary Griesmer codes and some small Singleton defect codes are also given.