Jack H. van Lint
List of publications from the
2005 |
33 | 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) |
1999 |
32 | | Jack H. van Lint,
Ludo M. G. M. Tolhuizen:
On Perfect Ternary Constant Weight Codes.
Des. Codes Cryptography 18(1/3): 231-234 (1999) |
31 | | Dieter Jungnickel,
Jack H. van Lint:
Editorial.
Des. Codes Cryptography 18(1/3): 5-6 (1999) |
1998 |
30 | 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 |
29 | | Tom Høholdt,
Jacobus H. van Lint,
Ruud Pellikaan:
Order Functions and Evaluation Codes.
AAECC 1997: 138-150 |
28 | EE | Henk D. L. Hollmann,
Jacobus H. van Lint:
Universal Sequences.
Appl. Algebra Eng. Commun. Comput. 8(5): 347-352 (1997) |
27 | EE | Jack H. van Lint:
On the Number of Blocks in a Generalized Steiner System.
J. Comb. Theory, Ser. A 80(2): 353-355 (1997) |
1996 |
26 | | 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 |
1993 |
25 | EE | Rob J. M. Vaessens,
Emile H. L. Aarts,
Jacobus H. van Lint:
Genetic Algorithms in Coding Theory - A Table for A3(n, d).
Discrete Applied Mathematics 45(1): 71-87 (1993) |
24 | | Marijn van Eupen,
Jacobus H. van Lint:
On the minimum distance of ternary cyclic codes.
IEEE Transactions on Information Theory 39(2): 409-422 (1993) |
23 | | Jack H. van Lint,
Vladimir D. Tonchev:
A Class of Non-embeddable Designs.
J. Comb. Theory, Ser. A 62(2): 252-260 (1993) |
1992 |
22 | EE | Henk D. L. Hollmann,
Jacobus H. van Lint:
Nonblocking Self-Routing Switching Networks.
Discrete Applied Mathematics 37/38: 319-340 (1992) |
1991 |
21 | | P. J. N. de Rooij,
Jacobus H. van Lint:
More on the minimum distance of cyclic codes.
IEEE Transactions on Information Theory 37(1): 187- (1991) |
20 | | Jacobus H. van Lint:
Repeated-root cyclic codes.
IEEE Transactions on Information Theory 37(2): 343- (1991) |
1990 |
19 | | Ludo M. G. M. Tolhuizen,
Jacobus H. van Lint:
On the minimum distance of combinatorial codes.
IEEE Transactions on Information Theory 36(4): 922- (1990) |
1989 |
18 | EE | 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.
J. Comb. Theory, Ser. A 52(2): 304-312 (1989) |
1988 |
17 | | Jacobus H. van Lint:
Recent Results on Covering Problems.
AAECC 1988: 7-21 |
16 | | Jacobus H. van Lint:
Introduction to special section on coding theory.
IEEE Transactions on Information Theory 34(5): 1274- (1988) |
1987 |
15 | | Jacobus H. van Lint,
T. A. Springer:
Generalized Reed - Solomon codes from algebraic geometry.
IEEE Transactions on Information Theory 33(3): 305-309 (1987) |
1986 |
14 | | Jacobus H. van Lint,
Richard M. Wilson:
On the minimum distance of cyclic codes.
IEEE Transactions on Information Theory 32(1): 23-40 (1986) |
13 | | Jacobus H. van Lint,
Richard M. Wilson:
Binary cyclic codes generated by mira7.
IEEE Transactions on Information Theory 32(2): 283- (1986) |
1984 |
12 | | Jacobus H. van Lint:
On equidistant binary codes length n = 4k+1 with distance d = 2k.
Combinatorica 4(4): 321-323 (1984) |
11 | | Jack H. van Lint,
Vladimir D. Tonchev:
Nonembeddable Quasi-residual Designs with Large K.
J. Comb. Theory, Ser. A 37(3): 359-362 (1984) |
1983 |
10 | | R. D. Baker,
Jacobus H. van Lint,
Richard M. Wilson:
On the Preparata and Goethals codes.
IEEE Transactions on Information Theory 29(3): 342-344 (1983) |
1982 |
9 | | Peter J. Cameron,
Jack H. van Lint:
On the Partial Geometry pg(6, 6, 2).
J. Comb. Theory, Ser. A 32(2): 252-255 (1982) |
1981 |
8 | | Jacobus H. van Lint,
Alexander Schrijver:
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields.
Combinatorica 1(1): 63-73 (1981) |
1980 |
7 | | Aiden A. Bruen,
B. L. Rothschild,
Jack H. van Lint:
On Characterizing Subspaces.
J. Comb. Theory, Ser. A 29(2): 257-260 (1980) |
1979 |
6 | | E. F. Assmus Jr.,
Jack H. van Lint:
Ovals in Projective Designs.
J. Comb. Theory, Ser. A 27(3): 307-324 (1979) |
1978 |
5 | EE | Clement W. H. Lam,
Jack H. van Lint:
Directed graphs with unique paths of fixed length.
J. Comb. Theory, Ser. B 24(3): 331-337 (1978) |
1977 |
4 | | Jack H. van Lint,
Henk C. A. van Tilborg,
J. R. Wiekema:
Block Designs with v = 10, k = 5, lambda = 4.
J. Comb. Theory, Ser. A 23(1): 105-115 (1977) |
1974 |
3 | | B. L. Rothschild,
Jack H. van Lint:
Characterizing Finite Subspaces.
J. Comb. Theory, Ser. A 16(1): 97-110 (1974) |
1973 |
2 | | Jack H. van Lint:
Block Designs with Repeated Blocks and (b, r, lambda) = 1.
J. Comb. Theory, Ser. A 15(3): 288-309 (1973) |
1970 |
1 | | Jacobus H. van Lint:
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q)
Information and Control 16(4): 396-401 (1970) |