Title
Hyper-Kloosterman Sums and their Applications to the Coding Theory
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.
Year
DOI
Venue
2001
10.1007/s002000100080
Appl. Algebra Eng. Commun. Comput.
Keywords
Field
DocType
Keywords: Hyper-Kloosterman sums,Trace code,Weight distribution of codes.
Discrete mathematics,Combinatorics,Kloosterman sum,Uniform distribution (continuous),Coding theory,Universal code,Mathematics,Dual code,Binary number
Journal
Volume
Issue
ISSN
12
5
0938-1279
Citations 
PageRank 
References 
1
0.38
2
Authors
2
Name
Order
Citations
PageRank
Koji Chinen141.82
Toyokazu Hiramatsu210.72