Missing: Z4- | Show results with:Z4-

It is found that Theorem 4 is wrong for m even, and several previously established formulas on the Kloosterman sum identities can be rediscovered from The ...

Apr 2, 2019 · Shin D.J., Kumar P.V., Helleseth T.: 3-Designs from the Z4-Goethals codes via a new Kloosterman sum identity, Des. Codes Cryptography, 28, 247- ...

Kumar and T. Helleseth, An Assmus-Mattson-Type approach for identifying 3-designs from linear codes over Z4, submitted to Designs, Codes and Cryptography.

11. T. Helleseth and V. Zinoviev, On Z 4-linear Goethals codes and Kloosterman sums, Designs, Codes and Cryptography , Vol. 17 (1999) pp. 269-288.]].

We study the coset weight distributions of two well-known families of codes: the three-error-correcting binary Z/sub 4/-linear Goethals codes of length ...

Considering the coset weight distribution of Z4-linear Goethals codes we proved [7] the two following theorems. Theorem 2 (Helleseth and Zinoviev [7]). For any ...

Oct 22, 2024 · ... Helleseth, 3-Designs from the Z4-Goethals codes via a new Kloosterman sum. identity, Des. Codes Cryptogr. 28 (2003) 247–263. [9] Dong-Joon ...

Helleseth, 3-Designs from the Z4-Goethals codes via a new Kloosterman sum identity (1998) preprint. [21] K. Tanabe, An Assmus–Mattson theorem for Z4-codes ...

Recently, Shin and Sung found new identities for Kloosterman sums over F"2"^"m with odd m. They posed the question whether similar results could be obtained ...