An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case (Q2855610)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case |
scientific article; zbMATH DE number 6220319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case |
scientific article; zbMATH DE number 6220319 |
Statements
25 October 2013
0 references
linear code
0 references
Kloosterman sum
0 references
recursive formula
0 references
symplectic group
0 references
orthogonal group
0 references
parabolic subgroup
0 references
Pless identity
0 references
math.NT
0 references
cs.IT
0 references
math.IT
0 references
An infinite family of recursive formulas generating power moments of Kloosterman sums with trace one arguments: \(O(2n+1,2^{r})\) case (English)
0 references
In the paper the author considers the problem of construction of an infinite family of binary linear codes associated with double cosets with respect to a certain maximal parabolic subgroup of the orthogonal group \(O(2n+1, q)\). There is a good introduction to the problem and explanation of the used notations. This research is closely related to the author's previous papers. That is why there are a lot references to some other papers in the main text. Despite this fact the article is written in understandable way and the main result is an infinite family of recursive formulas generating the odd power moments of Kloosterman sums with trace one arguments.
0 references
