dblp.uni-trier.dewww.uni-trier.de

Henk D. L. Hollmann Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
36EEHenk D. L. Hollmann: Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes CoRR abs/0807.0595: (2008)
2007
35EEHenk D. L. Hollmann, Ludo M. G. M. Tolhuizen: Optimal codes for correcting a single (wrap-around) burst of errors CoRR abs/0712.2182: (2007)
34EEHenk 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
33EEHenk D. L. Hollmann, Ludo M. G. M. Tolhuizen: Generating parity check equations for bounded-distance iterative erasure decoding CoRR abs/cs/0606026: (2006)
32EEHenk 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)
31EEBram 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)
30EEHenk 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
29EEHenk 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)
28EEPim 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)
27EEHenk 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
26EEHenk D. L. Hollmann, Qing Xiang: Kloosterman sum identities over F2m. Discrete Mathematics 279(1-3): 277-286 (2004)
2003
25EEHenk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen: Optimal Interconnect ATPG Under a Ground-Bounce Constraint. ITC 2003: 369-378
24EEErik 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
22EEGary 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
21EEMargreta 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
20EEHenk 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)
19EEGary 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
17EERonald 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
16EEHenk 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
15EEHenk 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)
13EEHenk 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
6EEHenk 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
1EEHenk D. L. Hollmann: Pseudocyclic 3-class association schemes on 28 points. Discrete Mathematics 52(2-3): 209-224 (1984)

Coauthor Index

1Bram Van Asch [31]
2C. P. M. J. Baggen [12]
3Ben Bennetts (R. G. Bennetts) [24]
4Alex Biewenga [18]
5Aart Blokhuis [31]
6Ning Cai [23]
7Marten van Dijk [21]
8Gary L. Ebert [19] [22]
9Sebastian Egner [19] [22]
10Ronald Evans [17]
11Kees A. Schouhamer Immink [3] [5] [9]
12Frans de Jong [18]
13William M. Kantor [31]
14János Körner [13]
15Christian Krattenthaler [17]
16Margreta Kuijper [21]
17Jean-Paul M. G. Linnartz [12] [16]
18Jacobus H. van Lint (Jack H. van Lint) [6] [12] [15] [16] [28]
19Simon Litsyn [13]
20Maurice Lousberg [18]
21Erik Jan Marinissen [24] [25] [27]
22Job Oostveen [21]
23Henk C. A. van Tilborg [31]
24Ludo M. G. M. Tolhuizen [9] [16] [23] [28] [29] [30] [33] [34] [35]
25Pim Tuyls [28]
26Bart Vermeulen [24] [25] [27]
27Qing Xiang [17] [19] [20] [22] [26] [32]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)