Abstract
Let 𝔽p be a finite field with p elements, where p is a prime. Let N ≥ 2 be an integer and f the least positive integer satisfying pf ≡ −1 (mod N). Then we let q = p2f and r = qm. In this paper, we study the Walsh transform of the monomial function.
(Formula presented.).
for (Formula presented.). We shall present the value distribution of the Walsh transform of f(x) and show that it takes at most (Formula presented.) distinct values. In particular, we can obtain binary functions with three-valued Walsh transform and ternary functions with three-valued or four-valued Walsh transform. Furthermore, we present two classes of four-weight binary cyclic codes and six-weight ternary cyclic codes.
| Original language | English |
|---|---|
| Pages (from-to) | 217-228 |
| Number of pages | 12 |
| Journal | Cryptography and Communications |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 2014 |
| Externally published | Yes |
Keywords
- Cyclic code
- Gauss periods
- Gauss sums
- Value distribution
- Walsh transform