Complete weight enumerators of a class of linear codes
Let be the finite field with elements, where p is an odd prime and m is a positive integer. For a positive integer t, let and let be the trace function from onto . In this paper, let we define a p-ary linear code by We shall present the complete weight enumerators of the linear codes and give several classes of linear codes with a few weights. This paper generalizes the results of Yang and Yao (Des Codes Cryptogr, 2016).
- Publisher
- SPRINGER
- Issue Date
- 2017-04
- Language
- English
- Article Type
- Article
- Keywords
SECRET SHARING SCHEMES; AUTHENTICATION CODES; 3-WEIGHT CODES; CONSTRUCTION
- Citation
DESIGNS CODES AND CRYPTOGRAPHY, v.83, no.1, pp.83 - 99
- ISSN
- 0925-1022
- Appears in Collection
- RIMS Journal Papers
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 21 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.