2008 |
36 | EE | Henk D. L. Hollmann:
Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes
CoRR abs/0807.0595: (2008) |
2007 |
35 | EE | 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) |
34 | EE | 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 Transactions on Information Theory 53(2): 823-828 (2007) |
2006 |
33 | EE | Henk D. L. Hollmann,
Ludo M. G. M. Tolhuizen:
Generating parity check equations for bounded-distance iterative erasure decoding
CoRR abs/cs/0606026: (2006) |
32 | EE | Henk D. L. Hollmann,
Qing Xiang:
Pseudocyclic association schemes arising from the actions of PGL(2, 2m) and PGammaL(2, 2m).
J. Comb. Theory, Ser. A 113(6): 1008-1018 (2006) |
31 | EE | 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): 1594-1613 (2006) |
30 | EE | Henk D. L. Hollmann,
Ludo M. G. M. Tolhuizen:
Generic erasure correcting sets: Bounds and constructions.
J. Comb. Theory, Ser. A 113(8): 1746-1759 (2006) |
2005 |
29 | EE | 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) |
28 | EE | Pim Tuyls,
Henk D. L. Hollmann,
Jack H. van Lint,
Ludo M. G. M. Tolhuizen:
XOR-based Visual Cryptography Schemes.
Des. Codes Cryptography 37(1): 169-186 (2005) |
27 | EE | Henk D. L. Hollmann,
Erik Jan Marinissen,
Bart Vermeulen:
Optimal Interconnect ATPG Under a Ground-Bounce Constraint.
J. Electronic Testing 21(1): 17-31 (2005) |
2004 |
26 | EE | Henk D. L. Hollmann,
Qing Xiang:
Kloosterman sum identities over F2m.
Discrete Mathematics 279(1-3): 277-286 (2004) |
2003 |
25 | EE | Henk D. L. Hollmann,
Erik Jan Marinissen,
Bart Vermeulen:
Optimal Interconnect ATPG Under a Ground-Bounce Constraint.
ITC 2003: 369-378 |
24 | EE | Erik Jan Marinissen,
Bart Vermeulen,
Henk D. L. Hollmann,
Ben Bennetts:
Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint.
IEEE Design & Test of Computers 20(2): 8-18 (2003) |
23 | | Ning Cai,
Ludo M. G. M. Tolhuizen,
Henk D. L. Hollmann:
Common coordinates in consecutive addresses.
IEEE Transactions on Information Theory 49(12): 3308-3312 (2003) |
2002 |
22 | EE | 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): 201-206 (2002) |
2001 |
21 | EE | 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: 343-352 |
20 | EE | 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): 168-172 (2001) |
19 | EE | Gary L. Ebert,
Sebastian Egner,
Henk D. L. Hollmann,
Qing Xiang:
A Four-Class Association Scheme.
J. Comb. Theory, Ser. A 96(1): 180-191 (2001) |
1999 |
18 | | Alex Biewenga,
Henk D. L. Hollmann,
Frans de Jong,
Maurice Lousberg:
Static component interconnect test technology (SCITT) a new technology for assembly testing.
ITC 1999: 439-448 |
17 | EE | 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): 74-119 (1999) |
1998 |
16 | EE | 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): 121-133 (1998) |
1997 |
15 | EE | Henk D. L. Hollmann,
Jacobus H. van Lint:
Universal Sequences.
Appl. Algebra Eng. Commun. Comput. 8(5): 347-352 (1997) |
14 | | Henk D. L. Hollmann:
On an approximate eigenvector associated with a modulation code.
IEEE Transactions on Information Theory 43(5): 1672-1678 (1997) |
13 | EE | Henk D. L. Hollmann,
János Körner,
Simon Litsyn:
Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A 80(2): 388-393 (1997) |
1996 |
12 | | 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 |
11 | | Henk D. L. Hollmann:
Bounded-delay-encodable, block-decodable codes for constrained systems.
IEEE Transactions on Information Theory 42(6): 1957-1970 (1996) |
1995 |
10 | | Henk D. L. Hollmann:
On the construction of bounded-delay encodable codes for constrained systems.
IEEE Transactions on Information Theory 41(5): 1354-1378 (1995) |
9 | | Ludo M. G. M. Tolhuizen,
Kees A. Schouhamer Immink,
Henk D. L. Hollmann:
Constructions and properties of block codes for partial-response channels.
IEEE Transactions on Information Theory 41(6): 2019-2026 (1995) |
1994 |
8 | | Henk D. L. Hollmann:
A block-decodable (1, 8) runlength-limited rate 8/12 code.
IEEE Transactions on Information Theory 40(4): 1292- (1994) |
1993 |
7 | | Henk D. L. Hollmann:
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes.
IEEE Transactions on Information Theory 39(4): 1424- (1993) |
1992 |
6 | EE | Henk D. L. Hollmann,
Jacobus H. van Lint:
Nonblocking Self-Routing Switching Networks.
Discrete Applied Mathematics 37/38: 319-340 (1992) |
5 | | Kees A. Schouhamer Immink,
Henk D. L. Hollmann:
Prefix-Synchronized Run-Length-Limited Sequences.
IEEE Journal on Selected Areas in Communications 10(1): 214-222 (1992) |
1991 |
4 | | Henk D. L. Hollmann:
The general solution of write equalization for RLL (d, k) codes.
IEEE Transactions on Information Theory 37(3): 856-862 (1991) |
3 | | Henk D. L. Hollmann,
Kees A. Schouhamer Immink:
Schouhamer Immink. Performance of efficient balanced codes.
IEEE Transactions on Information Theory 37(3): 913- (1991) |
1990 |
2 | | Henk D. L. Hollmann:
Design of test sequences for VLSI self-testing using LFSR.
IEEE Transactions on Information Theory 36(2): 386-392 (1990) |
1984 |
1 | EE | Henk D. L. Hollmann:
Pseudocyclic 3-class association schemes on 28 points.
Discrete Mathematics 52(2-3): 209-224 (1984) |