Henk D. L. Hollmann, Qing Xiang Pseudocyclic association schemes arising from the actions of PGL(2, 2m) and PGammaL(2, 2m). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:6, pp:1008-1018 [Journal]
Henk D. L. Hollmann Design of test sequences for VLSI self-testing using LFSR. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:386-392 [Journal]
Henk D. L. Hollmann The general solution of write equalization for RLL (d, k) codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:856-862 [Journal]
Henk D. L. Hollmann A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1424-0 [Journal]
Henk D. L. Hollmann A block-decodable (1, 8) runlength-limited rate 8/12 code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1292-0 [Journal]
Henk D. L. Hollmann On the construction of bounded-delay encodable codes for constrained systems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1354-1378 [Journal]
Henk D. L. Hollmann Bounded-delay-encodable, block-decodable codes for constrained systems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1957-1970 [Journal]
Henk D. L. Hollmann On an approximate eigenvector associated with a modulation code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1672-1678 [Journal]
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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:823-828 [Journal]