Search the dblp DataBase

Publications of Author

1. Dieter Jungnickel, Jack H. van Lint
   Editorial. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1999, v:18, n:1/3, pp:5-6 [Journal]
   
2. Jack H. van Lint, Ludo M. G. M. Tolhuizen
   On Perfect Ternary Constant Weight Codes. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1999, v:18, n:1/3, pp:231-234 [Journal]
   
3. 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]
   
4. E. F. Assmus Jr., Jack H. van Lint
   Ovals in Projective Designs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:307-324 [Journal]
   
5. Aiden A. Bruen, B. L. Rothschild, Jack H. van Lint
   On Characterizing Subspaces. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:257-260 [Journal]
   
6. Peter J. Cameron, Jack H. van Lint
   On the Partial Geometry pg(6, 6, 2). [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1982, v:32, n:2, pp:252-255 [Journal]
   
7. 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]
   
8. Peter J. M. van Laarhoven, Emile H. L. Aarts, Jack H. van Lint, L. T. Wille
   New upper bounds for the football pool problem for 6, 7, and 8 matches. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:304-312 [Journal]
   
9. Jack H. van Lint
   Block Designs with Repeated Blocks and (b, r, lambda) = 1. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1973, v:15, n:3, pp:288-309 [Journal]
   
10. Jack H. van Lint
    On the Number of Blocks in a Generalized Steiner System. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:353-355 [Journal]
    
11. Jack H. van Lint, Vladimir D. Tonchev
    Nonembeddable Quasi-residual Designs with Large K. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:359-362 [Journal]
    
12. Jack H. van Lint, Vladimir D. Tonchev
    A Class of Non-embeddable Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:252-260 [Journal]
    
13. Jack H. van Lint, Henk C. A. van Tilborg, J. R. Wiekema
    Block Designs with v = 10, k = 5, lambda = 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:23, n:1, pp:105-115 [Journal]
    
14. B. L. Rothschild, Jack H. van Lint
    Characterizing Finite Subspaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:1, pp:97-110 [Journal]
    
15. C. W. H. Lam, Jack H. van Lint
    Directed graphs with unique paths of fixed length. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:3, pp:331-337 [Journal]