Complete weight enumerators of a class of linear codes

  • Jaehyun Ahn
  • , Dongseok Ka*
  • , Chengju Li
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

Let Fq be the finite field with q= pm elements, where p is an odd prime and m is a positive integer. For a positive integer t, let D⊂Fqt and let Tr m be the trace function from Fq onto Fp. In this paper, let D={(x1,x2,…,xt)∈Fqt\{(0,0,…,0)}:Trm(x1+x2+⋯+xt)=0}, we define a p-ary linear code CD by CD={c(a1,a2,…,at):(a1,a2,…,at)∈Fqt},where c(a1,a2,…,at)=(Trm(a1x12+a2x22+⋯+atxt2))(x1,x2,…,xt)∈D.We shall present the complete weight enumerators of the linear codes CD and give several classes of linear codes with a few weights. This paper generalizes the results of Yang and Yao (Des Codes Cryptogr, 2016).

Original languageEnglish
Pages (from-to)83-99
Number of pages17
JournalDesigns, Codes, and Cryptography
Volume83
Issue number1
DOIs
StatePublished - 1 Apr 2017

Keywords

  • Gauss sums
  • Linear codes
  • Weight distribution

Fingerprint

Dive into the research topics of 'Complete weight enumerators of a class of linear codes'. Together they form a unique fingerprint.

Cite this