A generalization of Kung's theorem

May 21, 2015 Β· Declared Dead Β· πŸ› Des. Codes Cryptogr.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Trygve Johnsen, Keisuke Shiromoto, Hugues Verdure arXiv ID 1505.05628 Category cs.IT: Information Theory Cross-listed cs.DM Citations 4 Venue Des. Codes Cryptogr. Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted