default search action
Henk D. L. Hollmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Jing Jiang
, Fenggui Pei, Cailin Wen, Minquan Cheng, Henk D. L. Hollmann:
Constructions of t-strongly multimedia IPP codes with length t+1. Des. Codes Cryptogr. 92(10): 2949-2970 (2024) - [c18]Junming Ke, Henk D. L. Hollmann, Ago-Erik Riet:
A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8). ISIT 2024: 2335-2340 - [i15]Henk D. L. Hollmann, Martin Puskin, Ago-Erik Riet:
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound. CoRR abs/2407.18124 (2024) - 2023
- [j40]Henk D. L. Hollmann
On some batch code properties of the simplex code. Des. Codes Cryptogr. 91(5): 1595-1605 (2023) - [j39]Henk D. L. Hollmann
Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes I. Finite Fields Their Appl. 86: 102146 (2023) - 2022
- [c17]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: 666-671 - [c16]Henk D. L. Hollmann:
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes. ISIT 2022: 1981-1986 - [c15]Henk D. L. Hollmann
Optimal Possibly Nonlinear 3-PIR Codes of Small Size. WAIFI 2022: 159-168 - [i14]Henk D. L. Hollmann:
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes. CoRR abs/2202.07917 (2022) - [i13]Henk D. L. Hollmann, Urmas Luhaäär:
Optimal possibly nonlinear 3-PIR codes of small size. CoRR abs/2208.14552 (2022) - 2021
- [j38]Henk D. L. Hollmann
Some basic results on finite linear recurring sequence subgroups. Finite Fields Their Appl. 73: 101844 (2021) - [i12]Henk D. L. Hollmann, Karan Khathuria
On some batch code properties of the simplex code. CoRR abs/2110.07421 (2021)
2010 – 2019
- 2019
- [j37]Tao Feng
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle. IEEE Trans. Inf. Theory 65(8): 4673-4682 (2019) - 2018
- [c14]Henk D. L. Hollmann
A Multi-layer Recursive Residue Number System. ISIT 2018: 1460-1464 - [i11]Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo M. G. M. Tolhuizen, Paul Gorissen:
A Multi-layer Recursive Residue Number System. CoRR abs/1801.07561 (2018) - 2015
- [j36]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): 5271-5279 (2015) - 2014
- [c13]Henk D. L. Hollmann
On the minimum storage overhead of distributed storage codes with a given repair locality. ISIT 2014: 1041-1045 - 2013
- [c12]Henk D. L. Hollmann
Storage codes - Coding rate and repair locality. ICNC 2013: 830-834 - [c11]Henk D. L. Hollmann
Characterizations and construction methods for linear functional-repair storage codes. ISIT 2013: 336-340 - [c10]Lluis Pamies-Juarez, Henk D. L. Hollmann
Locally repairable codes with multiple repair alternatives. ISIT 2013: 892-896 - [i10]Henk D. L. Hollmann:
Storage codes -- coding rate and repair locality. CoRR abs/1301.4300 (2013) - [i9]Lluis Pamies-Juarez, Henk D. L. Hollmann, Frédérique E. Oggier:
Locally Repairable Codes with Multiple Repair Alternatives. CoRR abs/1302.5518 (2013) - [i8]Henk D. L. Hollmann, Wencin Poh:
Characterizations and construction methods for linear functional-repair storage codes. CoRR abs/1307.5583 (2013)
2000 – 2009
- 2009
- [j35]Tor Helleseth, Henk D. L. Hollmann
Proofs of two conjectures on ternary weakly regular bent functions. IEEE Trans. Inf. Theory 55(11): 5272-5283 (2009) - 2008
- [j34]Xiwang Cao, Henk D. L. Hollmann
New Kloosterman sum identities and equalities over finite fields. Finite Fields Their Appl. 14(3): 823-833 (2008) - [c9]Henk D. L. Hollmann
Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures. ISIT 2008: 1050-1052 - [c8]Wil Michiels, Paul Gorissen, Henk D. L. Hollmann
Cryptanalysis of a Generic Class of White-Box Implementations. Selected Areas in Cryptography 2008: 414-428 - [i7]Henk D. L. Hollmann:
Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. CoRR abs/0807.0595 (2008) - [i6]Wil Michiels, Paul Gorissen, Henk D. L. Hollmann:
Cryptanalysis of White-Box Implementations. IACR Cryptol. ePrint Arch. 2008: 105 (2008) - 2007
- [j33]Henk D. L. Hollmann
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size. IEEE Trans. Inf. Theory 53(2): 823-828 (2007) - [i5]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Optimal codes for correcting a single (wrap-around) burst of errors. CoRR abs/0712.2182 (2007) - 2006
- [j32]Henk D. L. Hollmann
Pseudocyclic association schemes arising from the actions of PGL(2, 2m) and PGammaL(2, 2m). J. Comb. Theory A 113(6): 1008-1018 (2006) - [j31]Bram van Asch, Aart Blokhuis, Henk D. L. Hollmann
Jack van Lint (1932-2004): A survey of his scientific work. J. Comb. Theory A 113(8): 1594-1613 (2006) - [j30]Henk D. L. Hollmann
Generic erasure correcting sets: Bounds and constructions. J. Comb. Theory A 113(8): 1746-1759 (2006) - [c7]Henk D. L. Hollmann
Generating parity check equations for bounded-distance iterative erasure decoding. ISIT 2006: 514-517 - [i4]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Generating parity check equations for bounded-distance iterative erasure decoding. CoRR abs/cs/0606026 (2006) - 2005
- [j29]Pim Tuyls, Henk D. L. Hollmann
XOR-based Visual Cryptography Schemes. Des. Codes Cryptogr. 37(1): 169-186 (2005) - [j28]Henk D. L. Hollmann
Optimal Interconnect ATPG Under a Ground-Bounce Constraint. J. Electron. Test. 21(1): 17-31 (2005) - [j27]Henk D. L. Hollmann
A class of permutation polynomials of F2m related to Dickson polynomials. Finite Fields Their Appl. 11(1): 111-122 (2005) - [i3]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 abs/cs/0507068 (2005) - 2004
- [j26]Henk D. L. Hollmann
Kloosterman sum identities over F2m. Discret. Math. 279(1-3): 277-286 (2004) - [c6]Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann:
On the entropy rate of a hidden Markov model. ISIT 2004: 12 - 2003
- [j25]Erik Jan Marinissen
Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint. IEEE Des. Test Comput. 20(2): 8-18 (2003) - [j24]Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
Common coordinates in consecutive addresses. IEEE Trans. Inf. Theory 49(12): 3308-3312 (2003) - [c5]Henk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen:
Optimal Interconnect ATPG Under a Ground-Bounce Constraint. ITC 2003: 369-378 - 2002
- [j23]Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann
Proof of a Conjecture of De Caen and Van Dam. Eur. J. Comb. 23(2): 201-206 (2002) - [i2]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: 194 (2002) - [i1]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: 195 (2002) - 2001
- [j22]Henk D. L. Hollmann
Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes. J. Comb. Theory A 93(1): 168-172 (2001) - [j21]Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann
A Four-Class Association Scheme. J. Comb. Theory A 96(1): 180-191 (2001) - [c4]Margreta Kuijper
A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding. AAECC 2001: 343-352
1990 – 1999
- 1999
- [j20]Ronald Evans, Henk D. L. Hollmann
Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets. J. Comb. Theory A 87(1): 74-119 (1999) - [c3]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: 439-448 - 1998
- [j19]Henk D. L. Hollmann
On Codes with the Identifiable Parent Property. J. Comb. Theory A 82(2): 121-133 (1998) - 1997
- [j18]Henk D. L. Hollmann
Universal Sequences. Appl. Algebra Eng. Commun. Comput. 8(5): 347-352 (1997) - [j17]Henk D. L. Hollmann
Protection of software algorithms executed on secure modules. Future Gener. Comput. Syst. 13(1): 55-63 (1997) - [j16]Henk D. L. Hollmann
Tiling Hamming Space with Few Spheres. J. Comb. Theory A 80(2): 388-393 (1997) - [j15]Jan W. M. Bergmans, Henk D. L. Hollmann
Antiwhistle codes. IEEE Trans. Commun. 45(8): 893-896 (1997) - [j14]Henk D. L. Hollmann
On an approximate eigenvector associated with a modulation code. IEEE Trans. Inf. Theory 43(5): 1672-1678 (1997) - 1996
- [j13]Henk D. L. Hollmann
Bounded-delay-encodable, block-decodable codes for constrained systems. IEEE Trans. Inf. Theory 42(6): 1957-1970 (1996) - [c2]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 - 1995
- [j12]Henk D. L. Hollmann
On the construction of bounded-delay encodable codes for constrained systems. IEEE Trans. Inf. Theory 41(5): 1354-1378 (1995) - [j11]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): 2019-2026 (1995) - [j10]Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
On the realizability of biorthogonal, m-dimensional two-band filter banks. IEEE Trans. Signal Process. 43(3): 640-648 (1995) - 1994
- [j9]Henk D. L. Hollmann
A block-decodable (1, 8) runlength-limited rate 8/12 code. IEEE Trans. Inf. Theory 40(4): 1292-1296 (1994) - 1993
- [j8]Henk D. L. Hollmann
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. IEEE Trans. Inf. Theory 39(4): 1424-1427 (1993) - 1992
- [j7]Henk D. L. Hollmann
Nonblocking Self-Routing Switching Networks. Discret. Appl. Math. 37/38: 319-340 (1992) - [j6]Kees A. Schouhamer Immink, Henk D. L. Hollmann
Prefix-Synchronized Run-Length-Limited Sequences. IEEE J. Sel. Areas Commun. 10(1): 214-222 (1992) - 1991
- [j5]Henk D. L. Hollmann:
Elements of Maximum Order in a Matrix Group (Lih-Yuan Deng). SIAM Rev. 33(3): 479-481 (1991) - [j4]Henk D. L. Hollmann
The general solution of write equalization for RLL (d, k) codes. IEEE Trans. Inf. Theory 37(3): 856-862 (1991) - [j3]Henk D. L. Hollmann
Schouhamer Immink. Performance of efficient balanced codes. IEEE Trans. Inf. Theory 37(3): 913-918 (1991) - 1990
- [j2]Henk D. L. Hollmann
Design of test sequences for VLSI self-testing using LFSR. IEEE Trans. Inf. Theory 36(2): 386-392 (1990)
1980 – 1989
- 1985
- [c1]Pierre Duhamel, Henk D. L. Hollmann:
Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data. ICASSP 1985: 784-787 - 1984
- [j1]Henk D. L. Hollmann
Pseudocyclic 3-class association schemes on 28 points. Discret. Math. 52(2-3): 209-224 (1984)
Coauthor Index
aka: Ludo M. G. M. Tolhuizen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: