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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: October 30, 2000; revised version: February 28, 2001
Rights and permissions
About this article
Cite this article
Chinen, K., Hiramatsu, T. Hyper-Kloosterman Sums and their Applications to the Coding Theory. AAECC 12, 381–390 (2001). https://doi.org/10.1007/s002000100080
Issue Date:
DOI: https://doi.org/10.1007/s002000100080