HHHenk D. L. Hollmann
Henk D. L. Hollmann
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Henk D. L. Hollmann has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Qing Xiang
Department of Mathematical Sciences, University of Delaware, Newark, USA
3 shared publications - C.P.M.J. Baggen
Philips Research Laboratories. Prof. Holstlaan 4, WY8, 5656 AA Eindhoven, Netherlands
1 shared publication - Christian Krattenthaler
Institut für Mathematik Universität Wien Strudlhofgasse 4 A-1090 Wien Austria
1 shared publication J. H. van Lint
Philips Research Laboratories, Prof. Holstlaan 4, NL-5656 AA Eindhoven, The Netherlands NL
1 shared publicationJ.H. van Lint
Eindhoven University of Technology, Eindhoven, Netherlands
1 shared publication- Jean -Paul M. G. Linnartz
Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands
1 shared publication
Latest Publications
- Open Access
- 1 April 2001
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 7 (2) , 253-286
A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
- 1 April 2001
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 7 (2) , 253-286
Open AccessA Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
- Open Access
Gauss Sums, Jacobi Sums, and $p$-ranks of Cyclic Difference Sets
We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are $(2^d-1, 2^{d-1}-1, 2^{d-2}-1)$ cyclic difference sets in the multiplicative group of the finite field $F_{2^d}$ of $2^d$ elements, with $d \geq 2$. We show that, except for a few cases with small $d$, these difference sets are all pairwise inequivalent. This is accomplished in part by examining their 2-ranks. The 2-ranks of all of these difference sets were previously known, except for those connected with the Segre and Glynn hyperovals. We determine the 2-ranks of the difference sets arising from the Segre and Glynn hyperovals, in the following way. Stickelberger's theorem for Gauss sums is used to reduce the computation of these 2-ranks to a problem of counting certain cyclic binary strings of length $d$. This counting problem is then solved combinatorially, with the aid of the transfer matrix method. We give further applications of the 2-rank formulas, including the determination of the nonzeros of certain binary cyclic codes, and a criterion in terms of the trace function to decide for which $\beta$ in $F_{2^d}^*$ the polynomial $x^6 + x + \beta$ has a zero in $F_{2^d}$, when $d$ is odd.Open AccessGauss Sums, Jacobi Sums, and $p$-ranks of Cyclic Difference Sets
We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are $(2^d-1, 2^{d-1}-1, 2^{d-2}-1)$ cyclic difference sets in the multiplicative group of the finite field $F_{2^d}$ of $2^d$ elements, with $d \geq 2$. We show that, except for a few cases with small $d$, these difference sets are all pairwise inequivalent. This is accomplished in part by examining their 2-ranks. The 2-ranks of all of these difference sets were previously known, except for those connected with the Segre and Glynn hyperovals. We determine the 2-ranks of the difference sets arising from the Segre and Glynn hyperovals, in the following way. Stickelberger's theorem for Gauss sums is used to reduce the computation of these 2-ranks to a problem of counting certain cyclic binary strings of length $d$. This counting problem is then solved combinatorially, with the aid of the transfer matrix method. We give further applications of the 2-rank formulas, including the determination of the nonzeros of certain binary cyclic codes, and a criterion in terms of the trace function to decide for which $\beta$ in $F_{2^d}^*$ the polynomial $x^6 + x + \beta$ has a zero in $F_{2^d}$, when $d$ is odd. - 1 November 1997
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 80 (2) , 388-393
Tiling Hamming Space with Few Spheres
- 1 November 1997
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 80 (2) , 388-393
Tiling Hamming Space with Few Spheres
- 31 July 1997
- Published by Elsevier in Future Generation Computer Systems
- Vol. 13 (1) , 55-63
Protection of software algorithms executed on secure modules
- 31 July 1997
- Published by Elsevier in Future Generation Computer Systems
- Vol. 13 (1) , 55-63
Protection of software algorithms executed on secure modules
- 10 July 1997
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 8 (5) , 347-352
Universal Sequences
- 10 July 1997
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 8 (5) , 347-352
Universal Sequences