A generalization of Kung's theorem

From MaRDI portal
Publication:306069

DOI10.1007/S10623-015-0139-6zbMATH Open1379.94057arXiv1505.05628OpenAlexW3102407577MaRDI QIDQ306069FDOQ306069


Authors: Trygve Johnsen, Hugues Verdure, Keisuke Shiromoto Edit this on Wikidata


Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1505.05628




Recommendations




Cites Work


Cited In (12)





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)