A generalization of Kung's theorem
Information Theory
2015-10-05 v2 Discrete Mathematics
math.IT
Abstract
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 i=k+1,...,n, 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.
Cite
@article{arxiv.1505.05628,
title = {A generalization of Kung's theorem},
author = {Trygve Johnsen and Keisuke Shiromoto and Hugues Verdure},
journal= {arXiv preprint arXiv:1505.05628},
year = {2015}
}