On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q) - Jacobus H. van Lint (Inf. Control., 1970)

Block designs with repeated blocks. - Jacobus H. van Lint; H. J. Ryser (Discret. Math., 1972)

A new description of the Nadler code (Corresp.). - Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1972)

A theorem on equidistant codes. - Jack H. van Lint (Discret. Math., 1973)

Block Designs with Repeated Blocks and (b, r, lambda) = 1. - Jack H. van Lint (J. Comb. Theory A, 1973)

Characterizing Finite Subspaces. - B. L. Rothschild; Jack H. van Lint (J. Comb. Theory A, 1974)

Equidistant codes with distance 12. - J. I. Hall; A. J. F. M. Jansen; Antoon W. J. Kolen; Jack H. van Lint (Discret. Math., 1977)

Block Designs with v = 10, k = 5, lambda = 4. - Jack H. van Lint; Henk C. A. van Tilborg; J. R. Wiekema (J. Comb. Theory A, 1977)

Directed graphs with unique paths of fixed length. - Clement W. H. Lam; Jack H. van Lint (J. Comb. Theory B, 1978)

Generalized quadratic residue codes. - Jacobus H. van Lint; F. Jessie MacWilliams (IEEE Trans. Inf. Theory, 1978)

Ovals in Projective Designs. - E. F. Assmus Jr.; Jack H. van Lint (J. Comb. Theory A, 1979)

On Characterizing Subspaces. - Aiden A. Bruen; B. L. Rothschild; Jack H. van Lint (J. Comb. Theory A, 1980)

Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. - Jacobus H. van Lint; Alexander Schrijver (Comb., 1981)

On the Partial Geometry pg(6, 6, 2). - Peter J. Cameron; Jack H. van Lint (J. Comb. Theory A, 1982)

On the Preparata and Goethals codes. - Ronald D. Baker; Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1983)

On equidistant binary codes length n = 4k+1 with distance d = 2k. - Jacobus H. van Lint (Comb., 1984)

Nonembeddable Quasi-residual Designs with Large K. - Jack H. van Lint; Vladimir D. Tonchev (J. Comb. Theory A, 1984)

On the minimum distance of cyclic codes. - Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1986)

Binary cyclic codes generated by mira7. - Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1986)

Generalized Reed - Solomon codes from algebraic geometry. - Jacobus H. van Lint; T. A. Springer (IEEE Trans. Inf. Theory, 1987)

Recent Results on Covering Problems. - Jacobus H. van Lint (AAECC, 1988)

Introduction to special section on coding theory. - Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1988)

New upper bounds for the football pool problem for 6, 7, and 8 matches. - Peter J. M. van Laarhoven; Emile H. L. Aarts; Jack H. van Lint; L. T. Wille (J. Comb. Theory A, 1989)

On the minimum distance of combinatorial codes. - Ludo M. G. M. Tolhuizen; Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1990)

Repeated-root cyclic codes. - Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1991)

More on the minimum distance of cyclic codes. - P. J. N. de Rooij; Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1991)

A course in combinatorics. - Jacobus H. van Lint; Richard M. Wilson 001 (Cambridge University Press, 1992)

Nonblocking Self-Routing Switching Networks. - Henk D. L. Hollmann; Jacobus H. van Lint (Discret. Appl. Math., 1992)

Genetic Algorithms in Coding Theory - A Table for A3(n, d). - Rob J. M. Vaessens; Emile H. L. Aarts; Jacobus H. van Lint (Discret. Appl. Math., 1993)

A Class of Non-embeddable Designs. - Jack H. van Lint; Vladimir D. Tonchev (J. Comb. Theory A, 1993)

On the minimum distance of ternary cyclic codes. - Marijn van Eupen; Jacobus H. van Lint (IEEE Trans. Inf. Theory, 1993)

Protection of Software Algorithms Executed on Secure Microprocessors. - Henk D. L. Hollmann; Jean-Paul M. G. Linnartz; Jacobus H. van Lint; C. P. M. J. Baggen (CARDIS, 1996)

Order Functions and Evaluation Codes. - Tom Høholdt; Jacobus H. van Lint; Ruud Pellikaan (AAECC, 1997)

Universal Sequences. - Henk D. L. Hollmann; Jacobus H. van Lint (Appl. Algebra Eng. Commun. Comput., 1997)

Protection of software algorithms executed on secure modules. - Henk D. L. Hollmann; Jean-Paul M. G. Linnartz; Jacobus H. van Lint; Constant P. M. J. Baggen; Ludo M. G. M. Tolhuizen (Future Gener. Comput. Syst., 1997)

On the Number of Blocks in a Generalized Steiner System. - Jack H. van Lint (J. Comb. Theory A, 1997)

On Codes with the Identifiable Parent Property. - Henk D. L. Hollmann; Jack H. van Lint; Jean-Paul M. G. Linnartz; Ludo M. G. M. Tolhuizen (J. Comb. Theory A, 1998)

On perfect constant weight codes. - Tuvi Etzion; Jack H. van Lint (Codes and Association Schemes, 1999)

Editorial. - Dieter Jungnickel; Jack H. van Lint (Des. Codes Cryptogr., 1999)

On Perfect Ternary Constant Weight Codes. - Jack H. van Lint; Ludo M. G. M. Tolhuizen (Des. Codes Cryptogr., 1999)

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes. - Henk D. L. Hollmann; Jacobus H. van Lint; Ludo M. G. M. Tolhuizen; Pim Tuyls (IACR Cryptol. ePrint Arch., 2002)

A polarisation based Visual Crypto System and its Secret Sharing Schemes. - Pim Tuyls; Henk D. L. Hollmann; Jacobus H. van Lint; Ludo M. G. M. Tolhuizen (IACR Cryptol. ePrint Arch., 2002)

XOR-based Visual Cryptography Schemes. - Pim Tuyls; Henk D. L. Hollmann; Jack H. van Lint; Ludo M. G. M. Tolhuizen (Des. Codes Cryptogr., 2005)