Zobrazeno 1 - 10
of 361
pro vyhledávání: '"Tor Helleseth"'
Publikováno v:
IEEE Transactions on Information Theory. 69:4035-4044
Publikováno v:
IEEE Transactions on Information Theory. 69:2485-2493
Publikováno v:
Advances in Mathematics of Communications
Advances in Mathematics of Communications, AIMS, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, AIMS, 2021, ⟨10.3934/amc.2021022⟩
Advances in Mathematics of Communications, 2021, ⟨10.3934/amc.2021022⟩
In this paper, for each of six families of three-valued \begin{document}$ m $\end{document} -sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring \begin{document}$ R = \mathbb{F}_2+u\mathbb{F}_2 $\
Publikováno v:
IEEE Transactions on Information Theory
Let n be a positive integer and p a prime. The power mapping xpn−3 over Fpn has desirable differential properties, and its differential spectra for p=2,3 have been determined. In this paper, for any odd prime p , by investigating certain quadratic
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2022
IEEE Transactions on Information Theory, 2022
International audience; We prove that the covering radius of the Melas code M (m, q) of length n = q m − 1 over Fq is 2 if q > 3. We also prove that the covering radius of M (m, 3) is 3 is m ≥ 3, the covering radius of M (2, 3) is 4, and the cove
Autor:
Dan Zhang, Tor Helleseth
Publikováno v:
IEEE Transactions on Information Theory. 68:3381-3388
Publikováno v:
Cryptography and Communications. 14:1207-1209
Publikováno v:
IEEE Transactions on Information Theory. 68:1683-1695
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and anal
Publikováno v:
IEEE Transactions on Information Theory. 67:6952-6962
A new method is used to resolve a long-standing conjecture of Niho concerning the crosscorrelation spectrum of a pair of maximum length linear recursive sequences of length $2^{2m}-1$ with relative decimation $d=2^{m+2}-3$ , where $m$ is even. The re
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, Springer Verlag, 2021
Designs, Codes and Cryptography, 2021
Designs, Codes and Cryptography, Springer Verlag, 2021
Designs, Codes and Cryptography, 2021
The automorphism group of the Zetterberg code Z of length 17 (also a quadratic residue code) is a rank three group whose orbits on the coordinate pairs determine two strongly regular graphs equivalent to the Paley graph attached to the prime 17. As a