The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henk D. L. Hollmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Margreta Kuijper, Marten van Dijk, Henk D. L. Hollmann, Job Oostveen
    A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:343-352 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CARDIS, 1996, pp:- [Conf]
  3. Alex Biewenga, Henk D. L. Hollmann, Frans de Jong, Maurice Lousberg
    Static component interconnect test technology (SCITT) a new technology for assembly testing. [Citation Graph (0, 0)][DBLP]
    ITC, 1999, pp:439-448 [Conf]
  4. Henk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen
    Optimal Interconnect ATPG Under a Ground-Bounce Constraint. [Citation Graph (0, 0)][DBLP]
    ITC, 2003, pp:369-378 [Conf]
  5. Henk D. L. Hollmann, Jacobus H. van Lint
    Universal Sequences. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:347-352 [Journal]
  6. Henk D. L. Hollmann, Jacobus H. van Lint
    Nonblocking Self-Routing Switching Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:319-340 [Journal]
  7. Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, Ludo M. G. M. Tolhuizen
    XOR-based Visual Cryptography Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:169-186 [Journal]
  8. Henk D. L. Hollmann, Qing Xiang
    Kloosterman sum identities over F2m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:277-286 [Journal]
  9. Erik Jan Marinissen, Bart Vermeulen, Henk D. L. Hollmann, Ben Bennetts
    Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint. [Citation Graph (0, 0)][DBLP]
    IEEE Design & Test of Computers, 2003, v:20, n:2, pp:8-18 [Journal]
  10. Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang
    Proof of a Conjecture of De Caen and Van Dam. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:2, pp:201-206 [Journal]
  11. Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang
    A Four-Class Association Scheme. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:96, n:1, pp:180-191 [Journal]
  12. Ronald Evans, Henk D. L. Hollmann, Christian Krattenthaler, Qing Xiang
    Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:74-119 [Journal]
  13. Henk D. L. Hollmann, János Körner, Simon Litsyn
    Tiling Hamming Space with Few Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:388-393 [Journal]
  14. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:82, n:2, pp:121-133 [Journal]
  15. Henk D. L. Hollmann, Qing Xiang
    Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:168-172 [Journal]
  16. Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
    Generic erasure correcting sets: Bounds and constructions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1746-1759 [Journal]
  17. 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]
  18. Kees A. Schouhamer Immink, Henk D. L. Hollmann
    Prefix-Synchronized Run-Length-Limited Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1992, v:10, n:1, pp:214-222 [Journal]
  19. Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
    Common coordinates in consecutive addresses. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3308-3312 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Henk D. L. Hollmann, Kees A. Schouhamer Immink
    Schouhamer Immink. Performance of efficient balanced codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:913-0 [Journal]
  28. Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann
    Constructions and properties of block codes for partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2019-2026 [Journal]
  29. 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]
  30. Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
    Generating parity check equations for bounded-distance iterative erasure decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  31. Henk Hollmann
    Pseudocyclic 3-class association schemes on 28 points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:209-224 [Journal]
  32. Henk D. L. Hollmann, Erik Jan Marinissen, Bart Vermeulen
    Optimal Interconnect ATPG Under a Ground-Bounce Constraint. [Citation Graph (0, 0)][DBLP]
    J. Electronic Testing, 2005, v:21, n:1, pp:17-31 [Journal]

  33. Cryptanalysis of a Generic Class of White-Box Implementations. [Citation Graph (, )][DBLP]


  34. On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size [Citation Graph (, )][DBLP]


  35. Optimal codes for correcting a single (wrap-around) burst of errors [Citation Graph (, )][DBLP]


  36. Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes [Citation Graph (, )][DBLP]


Search in 0.076secs, Finished in 0.077secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002