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.
Recommendations
Cites work
- scientific article; zbMATH DE number 952950 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- A Bound for the Maximum Weight of a Linear Code
- A generalization of weight polynomials to matroids
- Codes, arrangements and matroids
- Generalized Hamming weights for linear codes
- On the Covering Dimension of a Linear Code
- Relations between Möbius and coboundary polynomials
- Support weight distribution of linear codes
- Weight enumeration of codes from finite spaces
Cited in
(12)- The Doyen--Wilson theorem for kite systems
- scientific article; zbMATH DE number 5213051 (Why is no real title available?)
- Critical problem for codes over finite chain rings
- scientific article; zbMATH DE number 20337 (Why is no real title available?)
- A generalized Kakutani-Kodaira theorem
- On critical exponents of Dowling matroids
- scientific article; zbMATH DE number 4036532 (Why is no real title available?)
- A generalization of the Ando-Krieger theorem
- A generalized Kneser conjecture
- A generalization of Kneser's conjecture
- scientific article; zbMATH DE number 1559053 (Why is no real title available?)
- scientific article; zbMATH DE number 3847637 (Why is no real title available?)
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)