On the Hyper-Kloosterman Codes Over Galois Rings
- Etienne TANEDJEU ASSONGMO
Abstract
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.
- Full Text:
PDF
- DOI:10.5539/jmr.v12n2p12
Index
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- MathGuide
- MathSciNet
- Open policy finder
- RePEc
- ResearchGate
- Scilit
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org