Henk D.L. (Hendrik Dirk Lodewijk) Hollmann
Henk D.L. (Hendrik Dirk Lodewijk) Hollmann
Visiting professor, University of Tartu, Estonia
Verified email at xs4all.nl
Cited by
Cited by
'Split-radix' FFT algorithm
P Duhamel, H Hollmann
Electronics Letters 20 (1), 14-16, 1984
On codes with the identifiable parent property
HDL Hollmann, JH Van Lint, JP Linnartz, LMGM Tolhuizen
Journal of Combinatorial Theory, Series A 82 (2), 121-133, 1998
XOR-based visual cryptography schemes
P Tuyls, HDL Hollmann, JH Van Lint, L Tolhuizen
Designs, Codes and Cryptography 37 (1), 169-186, 2005
A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences
HDL Hollmann, Q Xiang
Finite Fields and Their Applications 7 (2), 253-286, 2001
Locally repairable codes with multiple repair alternatives
L Pamies-Juarez, HDL Hollmann, F Oggier
2013 IEEE international symposium on information theory, 892-896, 2013
Cryptanalysis of a generic class of white-box implementations
W Michiels, P Gorissen, HDL Hollmann
International workshop on selected areas in cryptography, 414-428, 2008
Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets
R Evans, HDL Hollmann, C Krattenthaler, Q Xiang
Journal of Combinatorial Theory, Series A 87 (1), 74-119, 1999
Copy protection system
J Talstra, M Maes, H Hollmann, M Van Dijk
US Patent App. 09/853,174, 2002
Presentation system for messages that provide information on demand and transmitter station and receiver station for use in such presentation system
HDL Hollmann, CD Holzscherer
US Patent 5,524,271, 1996
Coupling network for a data processor, including a series connection of a cross-bar switch and an array of silos
RJ Sluijter, HDL Hollmann, CM Huizer, H Dijkstra
US Patent 5,280,620, 1994
Proofs of two conjectures on ternary weakly regular bent functions
T Helleseth, HDL Hollmann, A Kholosha, Z Wang, Q Xiang
IEEE transactions on information theory 55 (11), 5272-5283, 2009
On parity-check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size
HDL Hollmann, LMGM Tolhuizen
IEEE transactions on information theory 53 (2), 823-828, 2007
On the realizability of biorthogonal, m-dimensional two-band filter banks
L Tolhuizen, H Hollmann, T Kalker
IEEE Transactions on Signal processing 43 (3), 640-648, 1995
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
HDL Hollmann
IEEE Transactions on Information Theory 39 (4), 1424-1427, 1993
A Class of Permutation Polynomials of $\bF_ {2^ m} $ Related to Dickson Polynomials
HDL Hollmann, Q Xiang
arXiv preprint math/0407424, 2004
On the entropy rate of a hidden Markov model
S Egner, VB Balakirsky, L Tolhuizen, S Baggen, H Hollmann
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 12, 2004
Existence of a 2n FFT algorithm with a number of multiplications lower than 2n+ 1
P Duhamel, H Hollmann
Electronics Letters 20 (17), 690-692, 1984
Storage codes—Coding rate and repair locality
HDL Hollmann
2013 International Conference on Computing, Networking and Communications …, 2013
Data processing method and apparatus for calculating a multiplicatively inverted element of a finite field
HDL Hollmann
US Patent 4,989,171, 1991
Generic erasure correcting sets: Bounds and constructions
HDL Hollmann, LMGM Tolhuizen
Journal of Combinatorial Theory, Series A 113 (8), 1746-1759, 2006
The system can't perform the operation now. Try again later.
Articles 1–20