Henk D. L. Hollmann

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 13

Top Topics

Scalar Quantization

Distributed Storage

Top Venues

IEEE Trans. Inf. Theory

Finite Fields Their Appl.

Publications

Henk D. L. Hollmann, Martin Puskin, Ago-Erik Riet
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound. CoRR (2024)
Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek
On some batch code properties of the simplex code. Des. Codes Cryptogr. 91 (5) (2023)
Henk D. L. Hollmann
Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes I. Finite Fields Their Appl. 86 (2023)
Henk D. L. Hollmann, Urmas Luhaäär
Optimal Possibly Nonlinear 3-PIR Codes of Small Size. WAIFI (2022)
Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel. ISIT (2022)
Henk D. L. Hollmann
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes. CoRR (2022)
Henk D. L. Hollmann, Urmas Luhaäär
Optimal possibly nonlinear 3-PIR codes of small size. CoRR (2022)
Henk D. L. Hollmann
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes. ISIT (2022)
Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek
On some batch code properties of the simplex code. CoRR (2021)
Henk D. L. Hollmann, Medet Zhanbulatuly
Some basic results on finite linear recurring sequence subgroups. Finite Fields Their Appl. 73 (2021)
Tao Feng, Henk D. L. Hollmann, Qing Xiang
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle. IEEE Trans. Inf. Theory 65 (8) (2019)
Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo M. G. M. Tolhuizen, Paul Gorissen
A Multi-layer Recursive Residue Number System. CoRR (2018)
Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo Tolhuizen, Paul Gorissen
A Multi-layer Recursive Residue Number System. ISIT (2018)
Xiaohu Tang, Bin Yang, Jie Li, Henk D. L. Hollmann
A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems. IEEE Trans. Inf. Theory 61 (10) (2015)
Henk D. L. Hollmann
On the minimum storage overhead of distributed storage codes with a given repair locality. ISIT (2014)
Lluis Pamies-Juarez, Henk D. L. Hollmann, Frédérique E. Oggier
Locally repairable codes with multiple repair alternatives. ISIT (2013)
Henk D. L. Hollmann, Wencin Poh
Characterizations and construction methods for linear functional-repair storage codes. ISIT (2013)
Lluis Pamies-Juarez, Henk D. L. Hollmann, Frédérique E. Oggier
Locally Repairable Codes with Multiple Repair Alternatives CoRR (2013)
Henk D. L. Hollmann, Wencin Poh
Characterizations and construction methods for linear functional-repair storage codes. CoRR (2013)
Henk D. L. Hollmann
Storage codes - Coding rate and repair locality. ICNC (2013)
Henk D. L. Hollmann
Storage codes -- coding rate and repair locality CoRR (2013)
Tor Helleseth, Henk D. L. Hollmann, Alexander Kholosha, Zeying Wang, Qing Xiang
Proofs of two conjectures on ternary weakly regular bent functions. IEEE Trans. Inf. Theory 55 (11) (2009)
Wil Michiels, Paul Gorissen, Henk D. L. Hollmann
Cryptanalysis of a Generic Class of White-Box Implementations. Selected Areas in Cryptography (2008)
Xiwang Cao, Henk D. L. Hollmann, Qing Xiang
New Kloosterman sum identities and equalities over finite fields. Finite Fields Their Appl. 14 (3) (2008)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures. ISIT (2008)
Henk D. L. Hollmann
Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes CoRR (2008)
Wil Michiels, Paul Gorissen, Henk D. L. Hollmann
Cryptanalysis of White-Box Implementations. IACR Cryptol. ePrint Arch. 2008 (2008)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size. IEEE Trans. Inf. Theory 53 (2) (2007)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
Optimal codes for correcting a single (wrap-around) burst of errors CoRR (2007)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
Generic erasure correcting sets: Bounds and constructions. J. Comb. Theory, Ser. A 113 (8) (2006)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
Generating parity check equations for bounded-distance iterative erasure decoding CoRR (2006)
Bram van Asch, Aart Blokhuis, Henk D. L. Hollmann, William M. Kantor, Henk C. A. van Tilborg
Jack van Lint (1932-2004): A survey of his scientific work. J. Comb. Theory, Ser. A 113 (8) (2006)
Henk D. L. Hollmann, Qing Xiang
). J. Comb. Theory, Ser. A 113 (6) (2006)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
Generating parity check equations for bounded-distance iterative erasure decoding. ISIT (2006)
Henk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen
Optimal Interconnect ATPG Under a Ground-Bounce Constraint. J. Electron. Test. 21 (1) (2005)
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size CoRR (2005)
Henk D. L. Hollmann, Qing Xiang
related to Dickson polynomials. Finite Fields Their Appl. 11 (1) (2005)
Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, Ludo M. G. M. Tolhuizen
XOR-based Visual Cryptography Schemes. Des. Codes Cryptogr. 37 (1) (2005)
Henk D. L. Hollmann, Qing Xiang
. Discret. Math. 279 (1-3) (2004)
Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann
On the entropy rate of a hidden Markov model. ISIT (2004)
Henk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen
Optimal Interconnect ATPG Under a Ground-Bounce Constraint. ITC (2003)
Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
Common coordinates in consecutive addresses. IEEE Trans. Inf. Theory 49 (12) (2003)
Erik Jan Marinissen, Bart Vermeulen, Henk D. L. Hollmann, Ben Bennetts
Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint. IEEE Des. Test Comput. 20 (2) (2003)
Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen
A polarisation based Visual Crypto System and its Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2002 (2002)
Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang
Proof of a Conjecture of De Caen and Van Dam. Eur. J. Comb. 23 (2) (2002)
Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls
An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes. IACR Cryptol. ePrint Arch. 2002 (2002)
Margreta Kuijper, Marten van Dijk, Henk D. L. Hollmann, Job Oostveen
A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding. AAECC (2001)
Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang
A Four-Class Association Scheme. J. Comb. Theory, Ser. A 96 (1) (2001)
Henk D. L. Hollmann, Qing Xiang
Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes. J. Comb. Theory, Ser. A 93 (1) (2001)
Alex S. Biewenga, Henk D. L. Hollmann, Frans G. M. de Jong, Maurice Lousberg
Static component interconnect test technology (SCITT) a new technology for assembly testing. ITC (1999)
Ronald Evans, Henk D. L. Hollmann, Christian Krattenthaler, Qing Xiang
Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets. J. Comb. Theory, Ser. A 87 (1) (1999)
Henk D. L. Hollmann, Jack H. van Lint, Jean-Paul M. G. Linnartz, Ludo M. G. M. Tolhuizen
On Codes with the Identifiable Parent Property. J. Comb. Theory, Ser. A 82 (2) (1998)
Jan W. M. Bergmans, Henk D. L. Hollmann, Johannes O. Voorman
Antiwhistle codes. IEEE Trans. Commun. 45 (8) (1997)
Henk D. L. Hollmann, Jacobus H. van Lint
Universal Sequences. Appl. Algebra Eng. Commun. Comput. 8 (5) (1997)
Henk D. L. Hollmann, János Körner, Simon Litsyn
Tiling Hamming Space with Few Spheres. J. Comb. Theory, Ser. A 80 (2) (1997)
Henk D. L. Hollmann
On an approximate eigenvector associated with a modulation code. IEEE Trans. Inf. Theory 43 (5) (1997)
Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, Constant P. M. J. Baggen, Ludo M. G. M. Tolhuizen
Protection of software algorithms executed on secure modules. Future Gener. Comput. Syst. 13 (1) (1997)
Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, C. P. M. J. Baggen
Protection of Software Algorithms Executed on Secure Microprocessors. CARDIS (1996)
Henk D. L. Hollmann
Bounded-delay-encodable, block-decodable codes for constrained systems. IEEE Trans. Inf. Theory 42 (6) (1996)
Henk D. L. Hollmann
On the construction of bounded-delay encodable codes for constrained systems. IEEE Trans. Inf. Theory 41 (5) (1995)
Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann, Antonius A. C. M. Kalker
On the realizability of biorthogonal, m-dimensional two-band filter banks. IEEE Trans. Signal Process. 43 (3) (1995)
Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann
Constructions and properties of block codes for partial-response channels. IEEE Trans. Inf. Theory 41 (6) (1995)
Henk D. L. Hollmann
A block-decodable (1, 8) runlength-limited rate 8/12 code. IEEE Trans. Inf. Theory 40 (4) (1994)
Henk D. L. Hollmann
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. IEEE Trans. Inf. Theory 39 (4) (1993)
Kees A. Schouhamer Immink, Henk D. L. Hollmann
Prefix-Synchronized Run-Length-Limited Sequences. IEEE J. Sel. Areas Commun. 10 (1) (1992)
Henk D. L. Hollmann, Jacobus H. van Lint
Nonblocking Self-Routing Switching Networks. Discret. Appl. Math. (1992)
Henk D. L. Hollmann, Kees A. Schouhamer Immink
Schouhamer Immink. Performance of efficient balanced codes. IEEE Trans. Inf. Theory 37 (3) (1991)
Henk D. L. Hollmann
The general solution of write equalization for RLL (d, k) codes. IEEE Trans. Inf. Theory 37 (3) (1991)
Henk D. L. Hollmann
Elements of Maximum Order in a Matrix Group (Lih-Yuan Deng). SIAM Rev. 33 (3) (1991)
Henk D. L. Hollmann
Design of test sequences for VLSI self-testing using LFSR. IEEE Trans. Inf. Theory 36 (2) (1990)
Pierre Duhamel, Henk D. L. Hollmann
Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data. ICASSP (1985)
Henk D. L. Hollmann
Pseudocyclic 3-class association schemes on 28 points. Discret. Math. 52 (2-3) (1984)