A generalization of Kung's theorem

From MaRDI portal
(Redirected from Publication:306069)




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.









This page was built for publication: A generalization of Kung's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306069)