摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 415-428 |
| 页数 | 14 |
| 期刊 | Advances in Mathematics of Communications |
| 卷 | 12 |
| 期 | 2 |
| DOI | |
| 出版状态 | 已出版 - 2018 |
学术指纹
探究 'On some classes of codes with a few weights' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver