Abstract
We generalize the code constructed recently by Wang et al, and obtain many classes of codes with a few weights. The weight distribution of these codes is completely determined, and the minimum distance of the duals of these codes is determined. We also show that some subclasses of the duals of these codes are optimal. Furthermore, some parameters of the generalized Hamming weight of these codes are calculated in certain cases.
| Original language | English |
|---|---|
| Pages (from-to) | 415-428 |
| Number of pages | 14 |
| Journal | Advances in Mathematics of Communications |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2018 |
Keywords
- Generalized Hamming weight
- Primitive root
- Secret sharing scheme
- Trace function
- Weight distribution