On the Hyper-Kloosterman Codes Over Galois Rings

  •  Etienne TANEDJEU ASSONGMO    


The Hyper-Kloosterman code was first defined over finite fields by Chinen-Hiramatsu, see (Chinen, & Hiramatsu, 2001). In the present paper we define the Hyper-Kloosterman codes over Galois rings R(pe;m). We show that this code is the trace of linear code over R(pe;m). By the Hyper-Kloostermann sums over Galois rings, we determine the Hamming weight of any codeword of this code over Galois rings.

This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1916-9795
  • ISSN(Online): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

  • h-index (February 2019): 18
  • i10-index (February 2019): 48
  • h5-index (February 2019): 7
  • h5-median (February 2019): 10

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )