Henk D. L. Hollmann

Computer Science · Physical Sciences

19h-index1.9kcitations109works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Coding theory and cryptography(59), graph theory and CDMA systems(37), Cellular Automata and Applications(26), Finite Group Theory Research(22), Advanced Data Storage Technologies(20)

Publications109 total

On the Minimum Length of Functional Batch Codes with Small Recovery Sets
ArXiv.org·2026Open Access
On the Minimum Length of Functional Batch Codes with Small Recovery Sets
arXiv (Cornell University)·2026Open Access
An optimal binary linear functional-repair storage code with efficient repair related to $$\textrm{PG}(2,8)$$
Designs Codes and Cryptography·2025
A Family of Optimal Linear Functional-Repair Regenerating Storage Codes
Entropy·2025· 1 citedOpen Access
A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8)
2024· 2 cited
Constructions of t-strongly multimedia IPP codes with length $$t+1$$
Designs Codes and Cryptography·2024
Optimal Possibly Nonlinear 3-PIR Codes of Small Size
Lecture notes in computer science·2023· 1 cited
On some batch code properties of the simplex code
Designs Codes and Cryptography·2022· 4 cited
Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes I
Finite Fields and Their Applications·2022· 2 cited
Optimal possibly nonlinear 3-PIR codes of small size
arXiv (Cornell University)·2022Open Access
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel
2022 IEEE International Symposium on Information Theory (ISIT)·2022· 2 cited
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes
2022 IEEE International Symposium on Information Theory (ISIT)·2022
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes
arXiv (Cornell University)·2022Open Access
On some batch code properties of the simplex code
arXiv (Cornell University)·2021Open Access
Some basic results on finite linear recurring sequence subgroups
Finite Fields and Their Applications·2021Open Access
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle
IEEE Transactions on Information Theory·2019· 5 cited
A Multi-layer Recursive Residue Number System
2018· 1 citedOpen Access
The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle
arXiv (Cornell University)·2018· 1 citedOpen Access
A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems
IEEE Transactions on Information Theory·2015· 27 cited
Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
Journal of Algebra·2014· 7 citedOpen Access
page 1 of 6Next →

Frequent Co-authors

Qing Xiang(13), Ludo Tolhuizen(9), Sebastian Egner(6), Pierre Duhamel(4), V.B. Balakirsky(3), Stan Baggen(3), Pim Tuyls(2), J. H. van Lint(2), Erik Jan Marinissen(2), Bart Vermeulen(2), Kees A. Schouhamer Immink(2), Gary L. Ebert(2), Dee Denteneer(2), Evgeny Verbitskiy(2), Jack H van Lint(1), Jean‐Paul M. G. Linnartz(1), Lluís Pàmies-Juàrez(1), Frédérique Oggier(1), Wil Michiels(1), Paul Gorissen(1)