×

Jack van Lint (1932–2004): a survey of his scientific work. (English) Zbl 1112.01017

Summary: When Jack van Lint was appointed as full professor at the Eindhoven University of Technology at the age of 26 he combined a PhD in number theory with a very open scientific mind. It took a sabbatical visit to Bell Laboratories in 1966 to make him understand that a new and fascinating field of applied mathematics was emerging: discrete mathematics. It fascinated and inspired him for the rest of his life. When he passed away on September 28, 2004, he left behind a legacy of 18 books and 177 articles, covering many aspects of coding theory, combinatorics, and finite geometry. van Lint was also a strong international advocate of the role that discrete mathematics ought to play in modern applied mathematics curricula. Quite a few departments sought his advice. Years later, four different universities showed their appreciation by awarding him an honorary degree.
This overview is an homage to van Lint’s academic achievements and can serve as an introduction to his work for younger generations.

MSC:

01A70 Biographies, obituaries, personalia, bibliographies
05-02 Research exposition (monographs, survey articles) pertaining to combinatorics
94-02 Research exposition (monographs, survey articles) pertaining to information and communication theory

Biographic References:

van Lint, Jacobus H.
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] van Lint, J. H., Über einige Dirichletsche Reihen, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 61, 56-60 (1958) · Zbl 0081.27302
[2] van Lint, J. H., On the multiplier system of the Riemann-Dedekind function \(η\), Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 61, 522-527 (1958) · Zbl 0085.30001
[3] van der Blij, F.; van Lint, J. H., On some special theta functions, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 60, 508-513 (1958) · Zbl 0083.07302
[4] van Lint, J. H., Linear relations for certain modular forms, Math. Nachr., 20, 123-126 (1959) · Zbl 0092.07601
[5] van Albada, P. J.; Laman, G.; van Lint, J. H., On the Hermitean product of ordered point sets on the unit circle, Michigan Math. J., 7, 245-250 (1960) · Zbl 0098.27502
[6] van Lint, J. H.; Post, K. A., A problem in Hilbert space, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 63, 409-411 (1960) · Zbl 0166.39404
[7] van Lint, J. H., Another sorting problem (problem 60-08), SIAM Rev., 3, 336-337 (1961)
[8] van Albada, P. J.; van Lint, J. H., On a recurring process in arithmetic, Nieuw Arch. Wisk., 9, 65-73 (1961) · Zbl 0114.26202
[9] de Doelder, P. J.; van Lint, J. H., Solution to problem 60-04, SIAM Rev., 3, 335-336 (1961)
[10] van Lint, J. H., Über die Approximation von Zahlen durch Reihen mit positiven Gliedern, Colloq. Math., 9, 281-285 (1962) · Zbl 0142.31001
[11] van Albada, P. J.; van Lint, J. H., Reciprocal bases for the integers, Amer. Math. Monthly, 70, 170-174 (1963) · Zbl 0122.29601
[12] de Bruijn, N. G.; van Lint, J. H., On the number of integers ⩽\(x\) whose prime factors divide \(n\), Acta Arith., 8, 349-356 (1963) · Zbl 0201.37601
[13] de Bruijn, N. G.; van Lint, J. H., On the asymptotic behaviour of some Dirichlet series with a complicated singularity, Nieuw Arch. Wisk., 11, 68-75 (1963) · Zbl 0117.28303
[14] van Lint, J. H.; Richert, H. E., Über die Summe \(\sum_{n \leqslant x, p(n) < y} \mu^2(n) / \phi(n)\), Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 67, 582-587 (1964) · Zbl 0318.10032
[15] de Bruijn, N. G.; van Lint, J. H., Incomplete sums of multiplicative functions I, II, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 67, 339-359 (1964) · Zbl 0131.28703
[16] van Lint, J. H.; Richert, H. E., On primes in arithmetic progressions, Acta Arith., 11, 209-216 (1965) · Zbl 0133.29901
[17] de Bruijn, N. G.; van Lint, J. H., On partial sums of \(\sum_{d | m} \phi(d)\), Simon Stevin, 39, 18-22 (1965) · Zbl 0151.03002
[18] Erdös, P.; van Lint, J. H., On the number of positive integers ⩽\(x\) and free of prime factors <\(y\), Simon Stevin, 40, 73-76 (1966) · Zbl 0146.05305
[19] van Lint, J. H.; Seidel, J. J., Equilateral point sets in elliptic geometry, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 69, 335-348 (1966) · Zbl 0138.41702
[20] Kamps, H. J.L.; van Lint, J. H., The football pool problem for 5 matches, J. Combin. Theory, 3, 315-325 (1967) · Zbl 0153.32602
[21] van Lint, J. H., Representation of 0 as \(\sum_{k = - N}^N \&z.epsi;_k k\), Proc. Amer. Math. Soc., 18, 182-184 (1967) · Zbl 0152.03401
[22] Graham, R. L.; van Lint, J. H., On the distribution of modulo 1, Canad. J. Math., 20, 1020-1024 (1968) · Zbl 0162.06701
[23] van Lint, J. H., Coding theory, (van Lint, J. H.; Seidel, J. J.; Baayen, P. C., Colloquium Discrete Wiskunde. Colloquium Discrete Wiskunde, MC Syllabus, vol. 5 (1968), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 51-75 · Zbl 0485.94015
[24] van Lint, J. H., Coding theory, Nieuw Arch. Wisk., 17, 128-132 (1969)
[25] van Lint, J. H., On the nonexistence of perfect 2- and 3-Hamming-error-correcting codes over \(GF(q)\), (Program and abstracts of papers to be presented at the 1970 International Symposium on Information Theory. Program and abstracts of papers to be presented at the 1970 International Symposium on Information Theory, Noordwijk, The Netherlands, 15-19 June, 1970 (1970), IEEE: IEEE New York), 3-4 · Zbl 0205.47102
[26] van Lint, J. H., On the nonexistence of perfect 2- and 3-Hamming-error-correcting codes over \(GF(q)\), Inform. Control, 16, 396-401 (1970) · Zbl 0205.47102
[27] van Lint, J. H., On the distribution of \(θ\) modulo 1, (Turan, P., Number Theory. Number Theory, Colloq. Math. Soc. János Bolyai, vol. 2 (1970), North-Holland: North-Holland Amsterdam), 139-140
[28] Kamps, H. J.L.; van Lint, J. H., A covering problem, (Erdös, P.; Renyi, A.; Sos, V. T., Combinatorial Theory and its Applications. Combinatorial Theory and its Applications, Colloq. Math. Soc. János Bolyai, vol. 4 (1970), North-Holland: North-Holland Amsterdam), 679-685 · Zbl 0231.05030
[29] van Lint, J. H., On the nonexistence of certain perfect codes, (Atkin, A. O.L.; Birch, B. J., Computers in Number Theory: Proceedings of the Science Research Council Atlas Symposium, No. 2, held at Oxford, 18-23 August, 1969 (1971), Academic Press: Academic Press London), 277-282 · Zbl 0226.94006
[30] van Lint, J. H., Nonexistence theorems for perfect error-correcting codes, (Birkhoff, G.; Hall, M., Computers in Algebra and Number Theory. Computers in Algebra and Number Theory, SIAM-AMS Proceedings, vol. 4 (1971), Amer. Math. Soc.: Amer. Math. Soc. Providence, RI), 89-95 · Zbl 0243.94007
[31] van Lint, J. H., Computer stamps from the Netherlands, J. Recreational Math., 1, 20-23 (1971)
[32] van Lint, J. H.; Ryser, H., Block designs with repeated blocks, Discrete Math., 3, 381-396 (1972) · Zbl 0251.05011
[33] Klamkin, M. S.; van Lint, J. H., An asymptotic problem in renewal theory, Statist. Neerlandica, 26, Sonderheft, 191-196 (1972) · Zbl 0248.60066
[34] van Lint, J. H., A new description of the Nadler code, IEEE Trans. Inform. Theory, 18, 825-826 (1972) · Zbl 0244.94009
[35] van Lint, J. H., De 13e internationale Wiskunde Olympiade, Euclides: Maandblad voor de Didactiek van de Wiskunde, 48, 47-58 (1972-1973)
[36] van Lint, J. H., Block designs with repeated blocks and \((b, r, \lambda) = 1\), J. Combin. Theory Ser. A, 15, 288-309 (1973) · Zbl 0285.05014
[37] van Lint, J. H., Asymptotisch goede algebraïsche codes, Verslagen van de Gewone Vergadering der Afd. Natuurkunde van de KNAW, 82, 171-173 (1973) · Zbl 0286.94010
[38] van Lint, J. H., A theorem of equidistant codes, Discrete Math., 6, 353-358 (1973) · Zbl 0271.94007
[39] Berlekamp, E. R.; van Lint, J. H.; Seidel, J. J., A strongly regular graph derived from the perfect ternary Golay code, (Srivastava, J. N., A Survey of Combinatorial Theory (1973), North-Holland: North-Holland Amsterdam), 25-30 · Zbl 0258.05129
[40] van Lint, J. H., A determinant related to the Jacobi symbol, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 76, 189-191 (1973) · Zbl 0259.15006
[41] van Lint, J. H., Solution to problem 349, Nieuw Arch. Wisk., 22, 93-94 (1974)
[42] van Lint, J. H., Solution to problem 350, Nieuw Arch. Wisk., 22, 94-111 (1974)
[43] van Lint, J. H., Recent results on perfect codes and related topics, (Hall, M.; van Lint, J. H., Combinatorics, Part 1: Theory of Designs, Finite Geometry and Coding Theory, Proceedings of the Advanced Institute on Combinatorics, held at Nijenrode Castle, Breukelen, The Netherlands, 8-20 July, 1974. Combinatorics, Part 1: Theory of Designs, Finite Geometry and Coding Theory, Proceedings of the Advanced Institute on Combinatorics, held at Nijenrode Castle, Breukelen, The Netherlands, 8-20 July, 1974, Mathematical Centre Tracts, vol. 55 (1974), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 158-178 · Zbl 0298.94014
[44] van Lint, J. H., Equidistant point sets, (McDonough, T. P.; Mavron, V. C., Combinatorics, the Proceedings of the British Combinatorial Conference, held in the University College of Wales. Combinatorics, the Proceedings of the British Combinatorial Conference, held in the University College of Wales, Aberystwyth, 2-6 July, 1973. Combinatorics, the Proceedings of the British Combinatorial Conference, held in the University College of Wales. Combinatorics, the Proceedings of the British Combinatorial Conference, held in the University College of Wales, Aberystwyth, 2-6 July, 1973, London Math. Soc. Lecture Note Ser., vol. 13 (1974), Cambridge Univ. Press: Cambridge Univ. Press Cambridge), 169-176 · Zbl 0305.05020
[45] Rothschild, B. L.; van Lint, J. H., Characterizing finite subspaces, J. Combin. Theory Ser. A, 16, 97-110 (1974) · Zbl 0273.05016
[46] Cameron, P. J.; Hall, J. I.; van Lint, J. H.; Springer, T. A.; van Tilborg, H. C.A., Translates of subgroups of the multiplicative group of a finite field, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 78, 285-289 (1975) · Zbl 0319.12010
[47] van Lint, J. H., Combinatorial designs constructed from or with coding theory, (Longo, G., Information Theory, New Trends and Open Problems. Information Theory, New Trends and Open Problems, CISM Courses and Lectures, vol. 219 (1975), Springer-Verlag: Springer-Verlag Wien), 227-262 · Zbl 0354.94008
[48] van Lint, J. H.; Pollak, H. O., An asymmetric contest for properties of arbitrary value, Philips Res. Rep., 30, 40-55 (1975) · Zbl 0318.90055
[49] van Lint, J. H., A survey of perfect codes, Rocky Mountain J. Math., 5, 199-224 (1975) · Zbl 0301.94007
[50] van Lint, J. H., A problem of bipartite graphs, Amer. Math. Monthly, 82, 55-56 (1975) · Zbl 0298.05138
[51] van Lint, J. H.; Kamps, H. J.L., A comparison of a classical calculus test with a similar multiple choice test, Educ. Stud. Math., 6, 259-271 (1975)
[52] van Lint, J. H., Recente ontwikkelingen in de combinatoriek, Nieuw Arch. Wisk., 24, 215-225 (1976) · Zbl 0337.05001
[53] van Lint, J. H., Perfecte codes, Nieuw Tijdschrift voor Wiskunde, 63, 230-236 (1976)
[54] Driessen, L. M.H. E.; Frederix, G. H.M.; van Lint, J. H., Linear codes supported by Steiner triple systems, Ars Combin., 1, 33-42 (1976) · Zbl 0337.94006
[55] van Lint, J. H., Voorbereidingen, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 1-9
[56] van Lint, J. H., De stelling van Shannon, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 10-18
[57] van Lint, J. H., Voorbeelden van codes, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 19-24
[58] van Lint, J. H.; Janssen, T. M.V., Lineaire codes, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 25-37
[59] van Lint, J. H.; van Emde Boas, P., Reed-Muller codes en de stelling van Chevalley, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 77-101
[60] van Lint, J. H.; van Tilborg, H. C.A., Gelijkmatig verdeelde codes, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 102-117
[61] van Lint, J. H., Asymptotisch goede algebraïsche codes, (van Lint, J. H., Inleiding in de Coderingstheorie. Inleiding in de Coderingstheorie, MC Syllabus, vol. 31 (1976), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 128-135
[62] van Lint, J. H., Educacion matematica a nivel universitario, excluyendo la preparacion de profesores, Boletin Informativo ICMI-CIAEM, 3, 31-39 (1976)
[63] J.H. van Lint, Mathematics education at university level, in: Proceedings of the 3rd International Congress on Mathematical Education, ICME-3, Karlsruhe, 1976, pp. 174-184; J.H. van Lint, Mathematics education at university level, in: Proceedings of the 3rd International Congress on Mathematical Education, ICME-3, Karlsruhe, 1976, pp. 174-184
[64] Hall, J. I.; Jansen, A. J.E. M.; Kolen, A. W.J.; van Lint, J. H., Equidistant codes with distance 12, Discrete Math., 17, 71-83 (1977) · Zbl 0355.94017
[65] J.H. van Lint, Een oud probleem uit de computerindustrie, in: P. van Emde Boas, J.K. Lenstra, F. Oort, et al. (Eds.), Een Pak Met een Korte Broek, papers presented to H.W. Lenstra Jr. on the occasion of the publication of his “Euclidische getallenlichamen”, Amsterdam, s.n., 1977, pp. 1-3; J.H. van Lint, Een oud probleem uit de computerindustrie, in: P. van Emde Boas, J.K. Lenstra, F. Oort, et al. (Eds.), Een Pak Met een Korte Broek, papers presented to H.W. Lenstra Jr. on the occasion of the publication of his “Euclidische getallenlichamen”, Amsterdam, s.n., 1977, pp. 1-3
[66] van Lint, J. H., Codes and designs, (Aigner, M., Higher Combinatorics, Proceedings of the NATO Advanced Study Institute, held in Berlin, West Germany, 1-10 September, 1976. Higher Combinatorics, Proceedings of the NATO Advanced Study Institute, held in Berlin, West Germany, 1-10 September, 1976, NATO Adv. Study Inst. Ser. C, vol. 31 (1977), Reidel: Reidel Dordrecht), 241-256 · Zbl 0373.94010
[67] van Lint, J. H.; van Tilborg, H. C.A.; Wiekema, J. R., Block designs with \(v = 10, k = 5, \lambda = 4\), J. Combin. Theory Ser. A, 23, 105-115 (1977) · Zbl 0359.05010
[68] Cvetkovic, D. M.; van Lint, J. H., An elementary proof of Lloyd’s theorem, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 80, 6-10 (1977) · Zbl 0349.94023
[69] van Lint, J. H., Ovales et codages, Cahiers du Centre d’Etudes de Recherche Operationelle, 20, 301-305 (1978) · Zbl 0396.05004
[70] van Lint, J. H., Non-embeddable quasi-residual designs, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 81, 269-275 (1978) · Zbl 0382.05014
[71] van Lint, J. H., Möbius vlakken, (Meetkunde, van Kunst tot Kunde, Vroeger en Nu. Meetkunde, van Kunst tot Kunde, Vroeger en Nu, Vakantiecursus, 1978 (1978), CWI: CWI Amsterdam), 57-65
[72] van Lint, J. H.; MacWilliams, F. J., Generalized quadratic residue codes, IEEE Trans. Inform. Theory, 24, 730-737 (1978) · Zbl 0395.94025
[73] Lam, C. W.H.; van Lint, J. H., Directed graphs with unique paths of fixed length, J. Combin. Theory Ser. B, 24, 331-337 (1978) · Zbl 0319.05112
[74] van Lint, J. H., Sphere-packings, codes, lattices and theta-functions, (Schrijver, A., Packing and Covering in Combinatorics. Packing and Covering in Combinatorics, Mathematical Centre Tracts, vol. 106 (1979), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 141-160 · Zbl 0438.52011
[75] Assmus, E. F.; van Lint, J. H., Ovals in projective designs, J. Combin. Theory Ser. A, 27, 307-324 (1979) · Zbl 0422.05022
[76] van Lint, J. H.; MacWilliams, F. J.; Sloane, N. J.A., On pseudo-random arrays, SIAM J. Appl. Math., 36, 62-72 (1979) · Zbl 0409.94024
[77] van Lint, J. H., Mathematics education at university level, (New Trends in Mathematics Teaching, prepared by the International Commission on Mathematical Instruction (ICMI), The Teaching of Basic Sciences, vol. 4 (1979), UNESCO: UNESCO Paris), 66-84
[78] van Lint, J. H., La educacion matematica al nivel universitario, (Nuevas Tendencias en la Enseñanza de la Matemática/preparado por la Comison International de Educación Matemática (1979), UNESCO: UNESCO Paris), 71-91
[79] van Lint, J. H., L’enseignement des mathématiques à l’Université, (Tendances Nouvelles de l’Enseignement des Mathématiques, prep. par la Commission Internationale de l’Enseignement Mathématique (CIEM). Tendances Nouvelles de l’Enseignement des Mathématiques, prep. par la Commission Internationale de l’Enseignement Mathématique (CIEM), Enseign. Sci. Math., vol. 4 (1979), UNESCO: UNESCO Paris), 70-89
[80] van Lint, J. H., Generalized quadratic-residue codes, (Longo, G., Algebraic Coding Theory and Applications. Algebraic Coding Theory and Applications, Summer School, 1978, Udine. Algebraic Coding Theory and Applications. Algebraic Coding Theory and Applications, Summer School, 1978, Udine, CISM Courses and Lectures, vol. 258 (1979), Springer-Verlag: Springer-Verlag Berlin), 285-310 · Zbl 0427.94021
[81] J.H. van Lint, Diagaku oyobi gakuin ni okeru süga ku kyöiku, Japanese translation of: Mathematics Education at University Level, 87-110; J.H. van Lint, Diagaku oyobi gakuin ni okeru süga ku kyöiku, Japanese translation of: Mathematics Education at University Level, 87-110
[82] Bruen, A. A.; Rothschild, B. L.; van Lint, J. H., On characterizing subspaces, J. Combin. Theory Ser. A, 29, 257-260 (1980) · Zbl 0455.05023
[83] van Lint, J. H., Recente ontwikkelingen in de cryptografie, Verslagen van de Gewone Vergadering der Afd. Natuurkunde van de KNAW, 89, 17-20 (1980) · Zbl 0431.94032
[84] van Lint, J. H., Notes on Egoritsjev’s proof of the van der Waerden conjecture, Linear Algebra Appl., 39, 1-8 (1981) · Zbl 0468.15005
[85] van Lint, J. H.; Schrijver, A., Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, Combinatorica, 1, 63-73 (1981) · Zbl 0491.05018
[86] J.H. van Lint, Was heisst heute gut codieren?, in: 10. Österreichischer Mathematiker Kongress, Innsbruck, 1981; J.H. van Lint, Was heisst heute gut codieren?, in: 10. Österreichischer Mathematiker Kongress, Innsbruck, 1981
[87] Chung, F. R.K.; Gilbert, E. N.; Graham, R. L.; Shearer, J. B.; van Lint, J. H., Tiling rectangles with rectangles, Math. Mag., 55, 286-291 (1982) · Zbl 0503.05021
[88] van Lint, J. H., The van der Waerden conjecture, two proofs in one year, Math. Intelligencer, 4, 72-77 (1982) · Zbl 0503.15009
[89] Cameron, P. J.; van Lint, J. H., On the partial geometry \(pg(6, 6, 2)\), J. Combin. Theory Ser. A, 32, 252-255 (1982) · Zbl 0484.05016
[90] Erdös, P.; van Lint, J. H., On the average ratio of the smallest and largest prime divisor of \(n\), Indag. Math., 44, 127-132 (1982) · Zbl 0489.10041
[91] van Lint, J. H., Mathematik und die Satellitenbilder der Planeten, Tetra, Zeitschrift für den Unterricht in Naturwissenschaften und Mathematik, 4, 39-41 (1982)
[92] van Lint, J. H., Coding, decoding and combinatorics, (Wilson, R. J., Applications of Combinatorics. Applications of Combinatorics, Shiva Math. Ser., vol. 6 (1982), Shiva: Shiva Nantwich), 67-74 · Zbl 0506.94013
[93] Haemers, W. H.; van Lint, J. H., A partial geometry \(pg(9, 8, 4)\), Ann. Discrete Math., 15, 205-212 (1982) · Zbl 0493.05011
[94] van Lint, J. H., The van der Waerden conjecture, Ann. Discrete Math., 18, 575-580 (1983) · Zbl 0511.15003
[95] van Lint, J. H., Public key cryptography, Nieuw Arch. Wisk., 1, 259-269 (1983) · Zbl 0529.94010
[96] Baker, R. D.; van Lint, J. H.; Wilson, R. M., On the Preparata and Goethals codes, IEEE Trans. Inform. Theory, 29, 342-345 (1983) · Zbl 0521.94015
[97] van Lint, J. H., Kerdock codes and Preparata codes, Congr. Numer., 39, 25-41 (1983) · Zbl 0549.94027
[98] van Lint, J. H., Cryptografie, Informatie, Maandblad voor Gegevensverwerking, 25, 47-51 (1983)
[99] van Lint, J. H., Algebraic coding theory, (Zweng, M.; Green, T.; Kilpatrick, J.; etal., Proceedings of the Fourth International Congress on Mathematical Education (1983), Birkhäuser: Birkhäuser Boston), 299-303
[100] van Lint, J. H., The influence of computers and informatics on mathematics and its teaching, ICMI Discussion Document, l’Enseignement Mathématique, 30, 159-172 (1984)
[101] Brouwer, A. E.; van Lint, J. H., Strongly regular graphs and partial geometries, (Jackson, D. M.; Vanstone, S. A., Enumeration and Design (1984), Academic Press: Academic Press London), 85-122 · Zbl 0555.05016
[102] van Lint, J. H., Partial geometries, (Ciesielski, Z.; Olech, C., ICM, International Congress of Mathematicians: Proceedings, vol. 2, Warszawa, Poland, 16-24 August, 1983 (1984), North-Holland: North-Holland Amsterdam), 1579-1589 · Zbl 0564.05013
[103] J.H. van Lint, On ovals in \(\mathit{PG}(2, 4)\); J.H. van Lint, On ovals in \(\mathit{PG}(2, 4)\)
[104] van Lint, J. H., On equidistant binary codes of length \(n = 4 k + 1\) with distance \(d = 2 k\), Combinatorica, 4, 321-323 (1984) · Zbl 0717.05016
[105] van Lint, J. H.; Tonchev, V. D., Nonembeddable quasi-residual designs with large \(K\), J. Combin. Theory Ser. A, 37, 359-362 (1984) · Zbl 0551.05020
[106] van Lint, J. H., \(\{0, 1, * \}\) distance problems in combinatorics, (Anderson, I., Surveys in Combinatorics 1985, Invited Papers for the Tenth British Combinatorial Conference. Surveys in Combinatorics 1985, Invited Papers for the Tenth British Combinatorial Conference, London Math. Soc. Lecture Note Ser., vol. 103 (1985), Cambridge Univ. Press: Cambridge Univ. Press Cambridge), 113-135
[107] van Lint, J. H., The education of mathematical engineers, Math. Ed., Apr.-Jun., 11-14 (1985)
[108] van Lint, J. H., On geometry and discrete mathematics, De Nieuwe Wiskrant, 5, 45-47 (1985)
[109] Hall, J. I.; van Lint, J. H., Constant distance code pairs, Proc. Kon. Nederl. Acad. Wetensch. Ser. A Math. Sci., 88, 41-45 (1985) · Zbl 0581.94020
[110] van Lint, J. H.; Wilson, R. M., On the minimum distance of cyclic codes, IEEE Trans. Inform. Theory, 32, 23-40 (1986) · Zbl 0616.94012
[111] van Lint, J. H.; Wilson, R. M., Binary cyclic codes generated by \(m_1 m_7\), IEEE Trans. Inform. Theory, 32, 283 (1986) · Zbl 0593.94013
[112] Brouwer, A. E.; van Lint, J. H., Silno regularnie grafi i chastichnie geometrii, Kibernet. Sb. (N.S.), 24, 186-229 (1987)
[113] van Lint, J. H.; Springer, T. A., Generalized Reed-Solomon codes from algebraic-geometry, IEEE Trans. Inform. Theory, 33, 305-309 (1987) · Zbl 0625.94012
[114] van Lint, J. H., Foutenverbetering op de compact disc, Voordracht gehouden op de 12de Gemeenschappelijke Studiedag NVvW-VVWL, Kapellen, 28 maart, 1987, Wiskunde en Onderwijs, 13, 452-459 (1987)
[115] van Lint, J. H., Foutenverbetering op de compact disc, Euclides, 63, 97-101 (1987/88)
[116] La Poutré, J. A.; van Lint, J. H., An associative block design \(ABD(10, 5)\) does not exist, Util. Math., 31, 219-225 (1987) · Zbl 0584.05011
[117] Beenker, G. F.M.; van Lint, J. H., Optimal generalized Petersen graphs, Philips J. Res., 43, 129-136 (1988) · Zbl 0655.05037
[118] van Lint, J. H., Discrete mathematics, some personal thoughts, (Howson, A. G.; Kahane, J.-P.; Lauginie, P.; etal., Mathematics as a Service Subject. Mathematics as a Service Subject, ICMI Study Ser. (1988), Cambridge Univ. Press: Cambridge Univ. Press Cambridge), 58-62
[119] van Lint, J. H., Coding theory, (van Lint, J. H.; van der Geer, G., Introduction to Coding Theory and Algebraic Geometry. Introduction to Coding Theory and Algebraic Geometry, DMV-Seminar, vol. 12 (1988), Birkhäuser: Birkhäuser Basel), 9-33 · Zbl 0485.94015
[120] van Lint, J. H., Coding theory. Introduction, IEEE Trans. Inform. Theory, 34, 1274-1275 (1988)
[121] van Lint, J. H., Chief guest’s address at the annual conference of AIMT on 30th January, 1988, Indian J. Math. Teaching, 14, 31-32 (1988)
[122] van Lint, J. H., Recent results on covering problems, (Mora, T., Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 6th International Conference, AAECC-6, Rome, Italy, 4-8 July, 1988. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 6th International Conference, AAECC-6, Rome, Italy, 4-8 July, 1988, Lecture Notes in Comput. Sci., vol. 357 (1989), Springer-Verlag: Springer-Verlag Berlin), 7-21 · Zbl 0676.05035
[123] Laarhoven, P. J.M.; van Lint, J. H.; Aarts, E. H.L.; Wille, L. T., New upper bounds for the football pool problem for 6, 7, and 8 matches, J. Combin. Theory Ser. A, 52, 304-312 (1989) · Zbl 0724.90085
[124] van Lint, J. H., Distance theorems for code pairs, (Bloom, G. S.; Graham, R. L.; Malkevitch, J., Combinatorial Mathematics, Proceedings of the Third International Conference. Combinatorial Mathematics, Proceedings of the Third International Conference, Ann. New York Acad. Sci., vol. 555 (1989), New York Academy of Sciences: New York Academy of Sciences New York), 421-424 · Zbl 0707.94015
[125] van Lint, J. H., Algebraic geometry codes, (Gaal, E. W.; Baggen, C. P.M. J., Proceedings of the First Concern Contact Meeting on Error-Correcting Codes. Proceedings of the First Concern Contact Meeting on Error-Correcting Codes, Nat. Lab. Report, vol. 6362 (1989), Philips Research Laboratories: Philips Research Laboratories Eindhoven), 4-9
[126] Tolhuizen, L. M.G. M.; van Lint, J. H., On the minimum distance of combinatorial codes, IEEE Trans. Inform. Theory, 36, 922-923 (1990) · Zbl 0707.94014
[127] van Lint, J. H., Coding for channels with localized errors, (Feijen, W. H.J.; van Gasteren, A. J.M.; Gries, D., Beauty is Our Business, a Birthday Salute to Edsger W. Dijkstra (1990), Springer-Verlag: Springer-Verlag Berlin), 274-279
[128] van Lint, J. H., Algebraic geometric codes, (Ray-Chaudhuri, D., Coding Theory and Design Theory, Part I: Coding Theory. Coding Theory and Design Theory, Part I: Coding Theory, IMA Vol. Math. Appl., vol. 20 (1990), Springer-Verlag: Springer-Verlag Berlin), 137-162
[129] van Lint, J. H.; Tonchev, V. D.; Landgev, I. N., A new design, (Ray-Chaudhuri, D., Coding Theory and Design Theory, Part II: Design Theory. Coding Theory and Design Theory, Part II: Design Theory, IMA Vol. Math. Appl., vol. 21 (1990), Springer-Verlag: Springer-Verlag Berlin), 251-256
[130] van Lint, J. H., Repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37, 343-345 (1991) · Zbl 0721.94017
[131] de Rooij, P. J.N.; van Lint, J. H., More on the minimum distance of cyclic codes, IEEE Trans. Inform. Theory, 37, 187-189 (1991) · Zbl 0712.94017
[132] van Lint, J. H., Stochastisch koelen en de voetbalpool, Verslagen van de Gewone Vergadering der Afd. Natuurkunde van de KNAW, 101, 39-44 (1992)
[133] van Lint, J. H., Recycling van ponskaarten?, Euclides, 67, 132-135 (1991-1992)
[134] van Eupen, M. J.M.; van Lint, J. H., On the minimum distance of ternary cyclic codes, IEEE Trans. Inform. Theory, 39, 409-422 (1993) · Zbl 0777.94016
[135] Vaessens, R. J.M.; Aarts, E. H.L.; van Lint, J. H., Genetic algorithms in coding theory—A table for \(A_3(n, d)\), Discrete Appl. Math., 45, 71-87 (1993) · Zbl 0780.94014
[136] van Lint, J. H., Codes and combinatorial designs, (Jungnickel, D.; Vanstone, S. A., Coding Theory, Design Theory, Group Theory, Proceedings of the Marshall Hall Conference (1993), Wiley-Interscience: Wiley-Interscience New York), 31-39 · Zbl 0800.90777
[137] van Lint, J. H.; Tonchev, V. D., A class of non-embeddable designs, J. Combin. Theory Ser. A, 62, 252-260 (1993) · Zbl 0772.05006
[138] van Lint, J. H., A European view of a course on discrete mathematics, New England Math. J., 25, 18-19 (1993)
[139] van Lint, J. H., What is discrete mathematics and how should we teach it?, (Proceedings of the 7th International Congress on Mathematical Education, ICME (1994), Presses de l’Univ. Laval: Presses de l’Univ. Laval Sainte-Foy), 367-368, (abstract)
[140] van Lint, J. H., What is discrete mathematics and how should we teach it?, (Robitaille, D. F.; Wheeler, D. H.; Kieran, C., Selected Lectures from the 7th International Congress on Mathematical Education, Laval University, Québec, 17-23 August, 1992 (1994), Presses de l’Université Laval: Presses de l’Université Laval Sainte-Foy), 263-270
[141] van Lint, J. H., Preface, Linear Algebra Appl., 226/228, 1-8 (1995)
[142] van Lint, J. H., Codes, (Graham, R. L.; Grötschel, M.; Lovasz, L., Handbook of Combinatorics, vol. 1 (1995), Elsevier: Elsevier Amsterdam), 773-807 · Zbl 0849.94018
[143] Hollmann, H. D.L.; Linmartz, J. P.M. G.; van Lint, J. H.; Baggen, C. P.M. J.; Tolhuizen, L. M.G. M., Protection of software algorithms executed on secure modules, (Hartel, P. H.; Paradinas, P.; Quisquater, J.-J., Proceedings CARDIS 1996, Smart Card Research and Advanced Applications, 2nd International Conference CARDIS 1996, CWI, Amsterdam, The Netherlands, 16-18 September, 1996 (1996), CWI: CWI Amsterdam), 133-143
[144] J.H. van Lint, Coding theory, Images of SMC Research 1996, Amsterdam, Stichting Mathematisch Centrum, 1996, pp. 113-121; J.H. van Lint, Coding theory, Images of SMC Research 1996, Amsterdam, Stichting Mathematisch Centrum, 1996, pp. 113-121
[145] van Lint, J. H., Uit de verdediging!, ITW Nieuws, 6, 2 (1996)
[146] Hollmann, H. D.L.; van Lint, J. H., Universal sequences, Appl. Algebra Engrg. Comm. Comput., 8, 347-352 (1997) · Zbl 0901.11008
[147] Hollmann, H. D.L.; Linnartz, J. P.M. G.; van Lint, J. H.; Baggen, C. P.M. J.; Tolhuizen, L. M.G. M., Protection of software algorithms executed on secure modules, Future Gener. Comput. Syst., 13, 55-63 (1997)
[148] van Lint, J. H., Paul Erdös (Erdös Pál) 26 maart 1913-20 september 1996, levensbericht door J.H. van Lint, (Levensberichten en Herdenkingen 1998 (1997), Koninklijke Nederlandse Akademie van Wetenschappen: Koninklijke Nederlandse Akademie van Wetenschappen Amsterdam), 35-39
[149] Høholdt, T.; van Lint, J. H.; Pellikaan, G. R., Order functions and evaluation codes, (Mora, T.; Mattson, H., Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 12th International Symposium, AAECC-12, Toulouse, France, 23-27 June, 1997. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 12th International Symposium, AAECC-12, Toulouse, France, 23-27 June, 1997, Lecture Notes in Comput. Sci., vol. 1255 (1997), Springer-Verlag: Springer-Verlag Berlin), 138-150 · Zbl 1043.94544
[150] van Lint, J. H., On the number of blocks in a generalized Steiner system, J. Combin. Theory Ser. A, 80, 353-355 (1997) · Zbl 0889.05014
[151] van Lint, J. H., Golay code, (Hazewinkel, M., Encyclopedia of Mathematics, Supplement I (1997), Kluwer Academic: Kluwer Academic Dordrecht), 271
[152] van Lint, J. H., Wiskunde en de compact disc, Nieuwe Wiskrant, Tijdschrift voor Nederlands Wiskundeonderwijs, 18, 12-16 (1998)
[153] van Lint, J. H., Mathematics and the compact disc, Johan Bernoulli lecture, 1998, Nieuw Arch. Wisk., 16, 183-190 (1998) · Zbl 0972.01034
[154] Hollmann, H. D.L.; van Lint, J. H.; Linnartz, J. P.M. G.; Tolhuizen, L. M.G. M., On codes with the identifiable parent property, J. Combin. Theory Ser. A, 82, 121-133 (1998) · Zbl 0910.05070
[155] van Lint, J. H., The mathematics of the compact disc, DMV-Mitteilungen, 4, 25-29 (1998) · Zbl 1288.94101
[156] J.H. van Lint, P. Erdös, Levensberichten en herdenkingen, Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen, 1998, pp. 35-39; J.H. van Lint, P. Erdös, Levensberichten en herdenkingen, Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen, 1998, pp. 35-39
[157] Høholdt, T.; van Lint, J. H.; Pellikaan, G. R., An elementary approach to algebraic geometry codes, Congr. Numer., 135, 25-35 (1998) · Zbl 0978.94046
[158] Høholdt, T.; van Lint, J. H.; Pellikaan, G. R., Algebraic geometry codes, (Pless, V. S.; Huffman, W. C., Handbook of Coding Theory, vol. 2 (1998), Elsevier: Elsevier Amsterdam), 871-961 · Zbl 0922.94015
[159] van Lint, J. H., The Stan Ackermans Institute, SEFI News, 76, 6 (1999)
[160] van Lint, J. H.; Tolhuizen, L. M.G. M., On perfect ternary constant weight codes, Des. Codes Cryptogr., 18, 231-234 (1999) · Zbl 0963.94038
[161] Jungnickel, D.; van Lint, J. H., Guest editorial, Des. Codes Cryptogr., 17, 5-6 (1999)
[162] Jungnickel, D.; van Lint, J. H., Editorial, Des. Codes Cryptogr., 18, 5 (1999)
[163] van Lint, J. H., Les mathématiques du disque compact, Textes Conf. Math., 4, 3-8 (2000)
[164] van Lint, J. H., Kompaktskivans matematik, Nordisk Matematisk Tidskrift, Normat, 48, 115-122 (2000)
[165] van Lint, J. H., Die Mathematik der Compact Disc, (Aigner, M.; Behrends, E., Alles Mathematik, von Pythagoras zum CD-Player (2000), Vieweg: Vieweg Braunschweig), 11-19
[166] J.H. van Lint, Coding theory and technology, lecture at La matemática como Base Conceptual de la Ciencia y la Technología, Simposio Internacional, Mathematics (the Conceptual Support of Science and Technology), Madrid, 11-12 Mayo, 2000; J.H. van Lint, Coding theory and technology, lecture at La matemática como Base Conceptual de la Ciencia y la Technología, Simposio Internacional, Mathematics (the Conceptual Support of Science and Technology), Madrid, 11-12 Mayo, 2000
[167] Etzion, T.; van Lint, J. H., On perfect constant weight codes, (DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 56 (2001)), 131-134 · Zbl 0983.94047
[168] Blokhuis, A.; Egner, S.; Hollmann, H. D.L.; van Lint, J. H., On codes with covering radius 1 and minimum distance 2, Indag. Math. (N.S.), 12, 449-452 (2001) · Zbl 1024.94020
[169] Blokhuis, A.; van Lint, J. H., Nieuw Arch. Wisk., 2, 207-209 (2001), In memoriam Johan Jacob Seidel
[170] van Lint, J. H., Buitenlandse plaatsen, tegenwoordig heten ze zo, plezier en hoofdbrekens dankzij quiz, Filatelie, 79, 930-934 (2001)
[171] van Lint, J. H., 0-1 Rijen, Tijdschrift van het Nederlands Elektronica en Radiogenootschap, 66, 11-16 (2001)
[172] van Lint, J. H., Rendement versus niveau, Nieuw Arch. Wisk., 3, 160-162 (2002)
[173] van Lint, J. H., Reactie—Het eindexamen vwo B12, Euclides, 78, 20 (2002-2003)
[174] van Lint, J. H., Codes, correcteurs d’erreurs, commentaires, (Où en sont les mathématiques?, Sous la Direct. de Jean-Michel Kantor (2002), Vuibert: Vuibert Paris), 169-172
[175] van Lint, J. H., Wiskunde en de compact disc, (Tien Jaar NWD, een Lichtbundel., s.l. (2004), Freudenthal Instituut), 34-39
[176] van Lint, J. H., Edsger Wybe Dijkstra, (Levensberichten en Herdenkingen 2004 (2004), Koninklijke Nederlandse Akademie van Wetenschappen: Koninklijke Nederlandse Akademie van Wetenschappen Amsterdam), 32-36, levensbericht door J.H. van Lint
[177] Anderson, I.; van Asch, A. G.; van Lint, J. H., Discrete mathematics in the high school curriculum, Zentralblatt für Didaktik der Mathematik, 36, 105-116 (2004)
[178] Tuyls, P.; Hollmann, H. D.L.; van Lint, J. H.; Tolhuizen, L. M.G. M., XOR-based visual cryptography schemes, Des. Codes Cryptogr., 37, 169-186 (2005) · Zbl 1136.94324
[179] Alon, N.; Fischer, E.; Szegedy, M., Parent-identifying codes, J. Combin. Theory Ser. A, 95, 349-359 (2001) · Zbl 0980.94039
[180] Blackburn, S. R., An upper bound on the size of a code with the \(k\)-identifiable parent property, J. Combin. Theory Ser. A, 102, 179-185 (2003) · Zbl 1020.94026
[181] Bose, R. C., Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math., 13, 389-419 (1963) · Zbl 0118.33903
[182] Castagnoli, G.; Massey, J. L.; Schoeller, P. A.; von Seeman, N., On repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37, 2 (March 1991)
[183] Cohen, A. M., A new partial geometry with parameters \((s, t, \alpha) = (7, 8, 4)\), J. Geom., 16, 181-186 (1981) · Zbl 0469.05020
[184] De Clerck, F.; Dye, R. H.; Thas, J. A., An infinite class of partial geometries associated with the hyperbolic quadric in \(PG(4 n - 1, 2)\), European J. Combin., 1, 323-326 (1980) · Zbl 0447.05019
[185] P. Dobcsányi, D.A. Preece, L.H. Soicher, On balanced incomplete block designs with repeated blocks, European J. Combin., in press; P. Dobcsányi, D.A. Preece, L.H. Soicher, On balanced incomplete block designs with repeated blocks, European J. Combin., in press
[186] H.D.L. Hollmann, Association schemes, Masters thesis, Eindhoven University of Technology, Dept. of Math. and Comp. Science, February 1982; H.D.L. Hollmann, Association schemes, Masters thesis, Eindhoven University of Technology, Dept. of Math. and Comp. Science, February 1982 · Zbl 0625.05015
[187] Hollmann, H. D.L., \(t\)-Designs with repeated points in \(Q\)-polynomial association schemes, Traitement du Signal, 1, 2, 163-168 (1984) · Zbl 0625.05015
[188] Kantor, W. M., Generalized quadrangles associated with \(G_2(q)\), J. Combin. Theory Ser. A, 29, 212-219 (1980) · Zbl 0465.51007
[189] Kantor, W. M., Spreads, translation planes and Kerdock sets, II, SIAM J. Algebraic Discrete Methods, 3, 308-318 (1982) · Zbl 0535.51003
[190] Kantor, W. M., On the inequivalence of generalized Preparata codes, IEEE Trans. Inform. Theory, 29, 345-348 (1983) · Zbl 0521.94016
[191] Kerdock, A. M., A class of low-rate nonlinear binary codes, Inform. Control, 20, 182-187 (1972) · Zbl 0271.94016
[192] McEliece, R. J., Weight congruences for \(p\)-ary cyclic codes, Discrete Math., 3, 117-192 (1972) · Zbl 0251.94008
[193] McLaughlin, J., A simple group of order \(898, 128, 000\), (Theory of Finite Groups (1969), Benjamin: Benjamin New York), 109-111 · Zbl 0205.32503
[194] Östergård, P. R.J.; Quistorff, J.; Wassermann, A., New results on codes with covering radius 1 and minimum distance 2, Des. Codes Cryptogr., 35, 2, 241-250 (2005) · Zbl 1081.94041
[195] Preparata, F. P., A class of optimum non-linear double-error-correcting codes, Inform. Contr., 13, 378-400 (1968) · Zbl 0167.47702
[196] C.L.M. van Pull, Some distance problems in coding theory, Doctoral thesis, Eindhoven University of Technology, 1987; C.L.M. van Pull, Some distance problems in coding theory, Doctoral thesis, Eindhoven University of Technology, 1987
[197] L.M.G.M. Tolhuizen, C.P.M.J. Baggen, Method and device for error protection of programmable memories, US patent 5,896,397, 13 April, 1999; L.M.G.M. Tolhuizen, C.P.M.J. Baggen, Method and device for error protection of programmable memories, US patent 5,896,397, 13 April, 1999
[198] Tietäväinen, A., On the non-existence of perfect codes over finite fields, SIAM J. Appl. Math., 24, 88-96 (1973)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.