Name
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,\\ldots ,n$$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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10623-015-0139-6 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Linear code,Kung’s bound,Generalized Singleton bound,94B05,05E40 | Integer,Discrete mathematics,Combinatorics,Finite field,Polynomial,Upper and lower bounds,Cardinality,Linear code,Critical exponent,Mathematics | Journal |
Volume | Issue | ISSN |
abs/1505.05628 | 1 | 0925-1022 |
Citations | PageRank | References |
2 | 0.42 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Trygve Johnsen | 1 | 33 | 7.94 |
| Keisuke Shiromoto | 2 | 39 | 8.41 |
| hugues verdure | 3 | 15 | 4.54 |