Name
Abstract | ||
|---|---|---|
Combinatorial t-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and t-designs has been attracted a lot of attention for both directions. It is well known that a linear code over any finite field can be derived from the incidence matrix of a t-design, meanwhile, that the supports of all codewords with a fixed weight in a code also may hold a t-design. In this paper, by determining the weight distribution of a class of linear codes derived from non-binary Kasami cyclic codes, we obtain infinite families of 2-designs from the supports of all codewords with a fixed weight in these codes, and calculate their parameters explicitly. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.3934/amc.2020088 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | DocType | Volume |
Linear codes, cyclic codes, affine-invariant codes, exponential sums, weight distributions, 2-designs | Journal | 15 |
Issue | ISSN | Citations |
4 | 1930-5346 | 1 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Wang | 1 | 23 | 12.43 |
| Xiaoni Du | 2 | 182 | 16.46 |
| Cui-Ling Fan | 3 | 120 | 12.44 |