Hyper-Kloosterman Sums and their Applications to the Coding Theory |
| |
Authors: | Koji Chinen Toyokazu Hiramatsu |
| |
Affiliation: | (1) Department of Mathematics, Faculty of Engineering, Osaka Institute of Technology, Omiya, Asahi-ku, Osaka 535-8585, Japan (e-mail: YHK03302@nifty.ne.jp), JP;(2) Division of Mathematical Science, College of Engineering, Hosei University, Koganei, Tokyo 184-8584, Japan (e-mail: hiramatu@k.hosei.ac.jp), JP |
| |
Abstract: | The dual code of the Melas code is called the Kloosterman code. The weights of its codewords can be expressed by the Kloosterman
sums, and are uniformly distributed with respect to the Sato-Tate measure. In this paper, the hyper-Kloosterman code C
m
(q), a generalization of the Kloosterman code is defined, and the uniform distribution property is deduced using the hyper-Kloosterman
sums when m is even and p− 1|m. Finally we discuss doubly-evenness for the weights in the binary case. It shows that we can construct infinitely many doubly-even
codes in a non-trivial way.
Received: October 30, 2000; revised version: February 28, 2001 |
| |
Keywords: | : Hyper-Kloosterman sums Trace code Weight distribution of codes |
本文献已被 SpringerLink 等数据库收录! |
|