Abstract
By choosing defining set properly, several classes of linear codes with a few weights over the finite field Fp are constructed for an odd prime p, and the complete weight enumerators of these classes of codes are determined.
Original language | English |
---|---|
Pages (from-to) | 717-734 |
Number of pages | 18 |
Journal | Bulletin of the Korean Mathematical Society |
Volume | 55 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2018 |
Keywords
- Authentication codes
- Complete weight enumerators
- Gauss sum
- Secret sharing schemes
- Trace function