A generalization of Kung's theorem

作者：Johnsen Trygve; Shiromoto Keisuke; Verdure Hugues^*

来源：Designs, Codes and Cryptography, 2016, 81(1): 169-178.

DOI：10.1007/s10623-015-0139-6

• Linear code
• Kung's bound
• Generalized Singleton bound

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all , we give an upper bound on the smallest integer m such that there exist m codewords whose union of supports has cardinality at least i.

• 出版日期2016-10