Name
Abstract | ||
|---|---|---|
By counting the coset leaders for cosets of weight 3 of the Melas code we give a new proof for the characterization of Kloosterman sums divisible by 3 for $${\mathbb{F}_{2^m}}$$ where m is odd. New results due to Charpin, Helleseth and Zinoviev then provide a connection to a characterization of all $${a\in\mathbb{F}_{2^m}}$$ such that $${Tr(a^{1/3})=0}$$ ; we prove a generalization to the case $${Tr(a^{1/(2^k-1)})=0}$$ . We present an application to constructing caps in PG(n, 2) with many free pairs of points. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10623-008-9171-0 | Des. Codes Cryptography |
Keywords | Field | DocType |
nonlinear function,cap,kloosterman sum | Discrete mathematics,Combinatorics,Kloosterman sum,Coset,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
49 | 1-3 | 0925-1022 |
Citations | PageRank | References |
6 | 0.70 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kseniya Garaschuk | 1 | 15 | 1.55 |
| petr lisonĕk | 2 | 43 | 3.71 |
| LisonĕkPetr | 3 | 6 | 0.70 |