J. H. van Lint | Academic Influence

J. H. van Lint's AcademicInfluence.com Rankings

J. H. van Lint

Mathematics

#2778

World Rank

#4215

Historical Rank

Measure Theory

#1026

World Rank

#1323

Historical Rank

mathematics Degrees

Download Badge

Mathematics

J. H. van Lint's Degrees

PhD Mathematics University of Amsterdam

Why Is J. H. van Lint Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jacobus Hendricus van Lint was a Dutch mathematician, professor at the Eindhoven University of Technology, of which he was rector magnificus from 1991 till 1996. He gained his Ph.D. from Utrecht University in 1957 under the supervision of Fred van der Blij. He was professor of mathematics at Eindhoven University of Technology from 1959 to 1997.

(See a Problem?)

J. H. van Lint's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A course in combinatorics (1992) (1651)
Introduction to Coding Theory (1982) (956)
Designs, graphs, codes, and their links (1991) (483)
Functions of one complex variable II (1997) (419)
Equilateral point sets in elliptic geometry (1966) (264)
On the minimum distance of cyclic codes (1986) (188)
On Codes with the Identifiable Parent Property (1998) (188)
Strongly regular graphs and partial geometries (1984) (168)
XOR-based Visual Cryptography Schemes (2005) (166)
Graphs, codes, and designs (1980) (165)
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (1981) (122)
Repeated-root cyclic codes (1991) (106)
Introduction to coding theory and algebraic geometry (1989) (105)
Concrete mathematics : a foundation for computer science / R.L. Graham, D.E. Knuth, O. Patashnik (1990) (99)
Graph theory, coding theory, and block designs (1975) (89)
Algebraic-geometric codes (1992) (82)
On the Preparata and Goethals codes (1983) (75)
Designs, Graphs, Codes and their Links: Codes (1991) (75)
A survey of perfect codes (1975) (75)
Generalized quadratic residue codes (1978) (73)
Generalized Reed - Solomon codes from algebraic geometry (1987) (70)
New upper bounds for the football pool problem for 6, 7, and 8 matches (1989) (50)
Combinatorial theory seminar, Eindhoven University of Technology (1974) (49)
Genetic Algorithms in Coding Theory - A Table for A3(n, d) (1993) (46)
The football pool problem for 5 matches (1967) (43)
Notes on Egoritsjev's proof of the van der Waerden conjecture (1981) (43)
A strongly regular graph derived from the perfect ternary Golay code (1973) (42)
On Perfect Ternary Constant Weight Codes (1999) (41)
On the minimum distance of ternary cyclic codes (1993) (41)
A Collection of Contributions in Honour of Jack Van Lint (1992) (40)
Nonexistence theorems for perfect error-correcting codes (1971) (39)
Ovals in Projective Designs (1979) (37)
Coding for channels with localized errors (1990) (35)
A Course in Combinatorics: Trees (2001) (30)
On primes in arithmetic progressions (1965) (29)
A covering problem (1970) (29)
A theorem on equidistant codes (1973) (28)
Block designs with repeated blocks (1972) (25)
On the Partial Geometry pg(6, 6, 2) (1982) (25)
On pseudo-random arrays (1979) (25)
Directed graphs with unique paths of fixed length (1978) (24)
Kerdock codes and Preparata codes (1983) (23)
Winning ways for your mathematical plays, vol. 1: Games in general; vol. 2: Games in particular / E.R. Berlekamp, J.H. Conway, R.K. Guy (1985) (23)
Covering radius problems (1988) (21)
Recent Results on Perfect Codes and Related Topics (1975) (21)
The van der waerden conjecture: two proofs in one year (1982) (19)
Block Designs with v = 10, k = 5, lambda = 4 (1977) (19)
{0,1,*} distance problems in combinatorics (1985) (19)
Equidistant codes with distance 12 (1977) (18)
Hecke operators and Euler products (1957) (18)
Incomplete sums of multiplicative functions. II (1964) (18)
Recent Results on Covering Problems (1988) (18)
A brief introduction to design theory (1975) (17)
Generalized bounds on binary/ternary mixed packing and covering codes (1991) (17)
Reciprocal bases for the integers (1963) (16)
Tiling rectangles with rectangles (1982) (16)
A Partial Geometry pg(9, 8, 4) (1982) (16)
Block Designs with Repeated Blocks and (b, r, lambda) = 1 (1973) (15)
A Course in Combinatorics: Two (0, 1, ⋆) problems: addressing for graphs and a hash-coding scheme (2001) (13)
Non-embeddable quasi-residual designs (1978) (13)
A polarisation based Visual Crypto System and its Secret Sharing Schemes (2002) (12)
Nonembeddable Quasi-residual Designs with Large K (1984) (12)
Characterizing Finite Subspaces (1974) (12)
Quadratic residue codes (1975) (12)
An elementary approach to algebraic geometry codes (1998) (12)
Order Functions and Evaluation Codes (1997) (12)
Representation of 0 as ∑ N k = -N ɛ k k (1967) (10)
On ovals in PG(2,4) and the McLaughlin graph (1984) (10)
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q) (1970) (10)
Binary cyclic codes generated by mira7 (1986) (10)
A Class of Non-embeddable Designs (1993) (9)
A new description of the Nadler code (Corresp.) (1972) (9)
Constant distance code pairs (1985) (8)
Error-correcting codes (1988) (7)
An elementary proof of Lloyd's theorem (1977) (7)
On the minimum distance of combinatorial codes (1990) (6)
Codes from curves (1988) (6)
On the nonexistence of perfect 5, 6 and 7-error-correcting codes over GF(q) (1970) (6)
On codes with covering radius 1 and minimum distance 2 (2001) (6)
On the Number of Blocks in a Generalized Steiner System (1997) (6)
A comparison of a classical calculus test with a similar multiple choice test (1975) (6)
On the nonexistence of certain perfect codes (1969) (6)
More on the minimum distance of cyclic codes (1991) (5)
Graphs with least eigenvalue –2 (1991) (5)
On the multipliersystem of the riemann–dedekind function η (1958) (5)
Codes and designs (1977) (5)
Sphere Packings, Lattices and Groups / J.H. Conway, N.J.A. Sloane (1990) (5)
Coding, decoding, and combinatorics (1982) (5)
On the asymptotic behaviour of some Dirichlet series with a complicated singularity (1963) (5)
OPTIMAL GENERALIZED PETERSEN GRAPHS (1988) (5)
Equidistant point sets (1974) (4)
Designs, Graphs, Codes and their Links: Design theory (1991) (4)
Combinatorial designs constructed from or with coding theory (1975) (4)
Editorial in the Second Special Issue "Designs and Codes - A Memorial Tribute to Ed Assmus" (1999) (4)
What is discrete mathematics and how should we teach it (1994) (4)
On the number of positive integers $\leq x$ and free of prime factors $>y$ (1966) (4)
A Course in Combinatorics: Preface to the second edition (2001) (4)
On a set of diophantine equations (1968) (3)
Distance Theorems for Code Pairs (1989) (3)
Nonblocking Self-Routing Switching Networks (1992) (3)
On some special theta functions (1958) (3)
The Stan Ackermans Institute (1999) (3)
Solution to problem 350 (1974) (3)
On equidistant binary codes of lengthn=4k+1 with distanced=2k (1984) (3)
A Course in Combinatorics: De Bruijn sequences (2001) (3)
Codes and combinatorial designs (1993) (3)
Linear codes supported by Steiner triple systems (1976) (3)
On the average ratio of the smallest and largest prime divisor of n (1982) (3)
Shannon’s Theorem (1992) (3)
Sphere-packings, codes, lattices and theta-functions (1979) (2)
Linear relations for certain modular forms (1959) (2)
An associative block design ABD(10,5) does not exist (1987) (2)
A Course in Combinatorics: The principle of inclusion and exclusion; inversion formulae (2001) (2)
Coding theory : Introduction (to special issue) (1988) (2)
Reed-Muller codes (1975) (2)
Mathematics education at university level (1977) (2)
A Course in Combinatorics: Elementary counting; Stirling numbers (2001) (2)
Solution to Problem 5460 [1967, 206] - Euler's constant (1968) (2)
On Characterizing Subspaces (1980) (2)
Preface (Special issue honoring J.J. Seidel) (1995) (2)
The mathematics of the compact disc (1998) (2)
Combinatorics : proceedings of the NATO Advanced Study Institute, held at Nijenrode Castle, Breukelen, The Netherlands, 8-20 July, 1974 (1975) (2)
Cryptography and data protection : proceedings of a symposium at the Royal Netherlands Academy of Arts and Sciences on 19th December 1990 (1992) (2)
Coding theory introduction (1988) (2)
On a recurring process in arithmetic (1961) (2)
Solution to problem 349 (1974) (1)
Universal Sequences (1997) (1)
Graphs, Codes and Designs: Strongly regular graphs (1980) (1)
A Course in Combinatorics: Lattices and Möbius inversion (2001) (1)
On partial sums of $\sum_{d|M} \varphi(d)$ (1965) (1)
A Course in Combinatorics: Turán's theorem and extremal graphs (2001) (1)
An asymptotic problem in renewal theory (1972) (1)
A Course in Combinatorics: Pólya theory of counting (2001) (1)
A European view of a course on discrete mathematics (1993) (1)
Codes over ℤ4 (1999) (1)
On geometry and discrete mathematics (1985) (1)
1967-1969 report of the Discrete Mathematics Group (1969) (1)
Chief guest's address at the Annual Conference of AIMT on 30th January 1988 (1988) (1)
Important Cyclic Codes (1971) (1)
Counting points on curves over finite fields (1988) (1)
Nearly perfect binary codes and uniformly packed codes (1991) (1)
A Course in Combinatorics: Flows in networks (2001) (1)
An asymmetric contest for properties of arbitrary value (1975) (1)
Divisors on algebraic curves (1988) (1)
Asymptotisch goede algebraische codes (1973) (1)
Computer stamps from The Netherlands (1971) (1)
Algebraic coding theory (1983) (1)
A determinant related to the Jacobi symbol (1973) (1)
Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13–15, 2001 Proceedings (2001) (1)
I. Permutations and combinations (1974) (1)
0-1 rijen (2001) (1)
Error correction for concatenated codes (1987) (1)
Solution to Problem 4944 [1961, 67] - Partitions of n (1962) (1)
Solution to Problem 60-8: Another sorting problem (1961) (1)
Some Good Codes (1992) (1)
Hua Loo-Keng (2000) (1)
Hadamard matrices, Reed–Muller codes (2001) (1)
Solution to Problem 5336 [1965,1030] - A sum over k-tuples (1966) (1)
A problem in Hilbert space (1960) (1)
The education of mathematical engineers (1985) (1)
Protection of software algorithms executed on secure modules (1997) (1)
Solution to Problem 5486 [1967,447] - Higher trigonometric identities (1968) (1)
Silno regularnie grafi i chastichnie geometrii : Strongly regular graphs and partial geometries (1987) (1)
De 13e Internationale Wiskunde Olympiade (1972) (1)
On the Hermitean product of ordered point sets on the unit circle (1960) (1)
The mathematics of Paul Erdös, I & II / ed. by R.L. Graham, J. Nesetril (1997) (1)
Mathematics and the Compact Disc : Johan Bernouilli Lecture 1998 (1998) (1)
A problem on bipartite graphs (1975) (1)
A Course in Combinatorics: Designs (2001) (1)
Public key cryptography (1999) (1)
Discrete mathematics : some personal thoughts (1988) (1)
Estimates of optimal stopping rules for the coin tossing game (1966) (0)
Book reviews (1985) (0)
Graphs, Codes and Designs: Partial geometries (1980) (0)
Designs, Graphs, Codes and their Links: Self-orthogonal codes and projective planes (1991) (0)
Genetic Algorithms in Coding Theory (2005) (0)
Colorings of graphs and Ramsey's theorem (2001) (0)
Difference sets and automorphisms (2001) (0)
Solution to Problem 5412 [1966,783] - The magnitude of least common multiples (1967) (0)
Designs, Graphs, Codes and their Links: Symmetry codes over F3 (1991) (0)
Veertig jaar THE-TUE (1999) (0)
Graphs with no triangles (1991) (0)
Self-dual codes (1988) (0)
Solution to Problem 4938 [1960,1933] - Representations with non-integral radix (1962) (0)
Solution to Problem 5600 [1968, 685] - Euler's constant, a Ramanujan identity (1969) (0)
Coding theory and technology : lecture (2000) (0)
A Course in Combinatorics: Hints and comments on problems (2001) (0)
Reed-Muller and Kerdock codes (1991) (0)
An algebraical identity (1968) (0)
Graphs, Codes and Designs: Finite geometries and codes (1980) (0)
A Course in Combinatorics: Whitney Duality (2001) (0)
The Golay codes (1991) (0)
Notation and terminology (1991) (0)
Asymptotically Good Algebraic Codes (1992) (0)
Graphs, Codes and Designs: Nearly perfect binary codes and uniformly packed codes (1980) (0)
Solution to Problem 5595 [1968, 552] - Maximum modulus of derivative of an entire function (1969) (0)
A Course in Combinatorics: Planarity and coloring (2001) (0)
Solution to Problem 5289 [1965,429] - Convergence factors for sums of reciprocals of primes (1966) (0)
Graphs, Codes and Designs: Self-orthogonal codes, designs and projective planes (1980) (0)
Codes and symmetric designs (2001) (0)
Solution to Problem 5639 [1968, 1125] - Free groups with two generators II (1969) (0)
A Course in Combinatorics: Formal power series (2001) (0)
XII. Finite geometries (1974) (0)
A Course in Combinatorics: Recursions and generating functions (2001) (0)
Classical Goppa codes (1988) (0)
Bounds on codes (1988) (0)
Repeated-root cyclic codes-Information Theory, IEEE Transactions on (2004) (0)
Solution to Problem 5452 [1967, 89] - Sequences with an odd number of real elements (1968) (0)
A property of the number six (1991) (0)
Graph Theory Coding Theory and Block Designs: Threshold decoding (1975) (0)
An Asymptotic Expansion (H. O. Pollak and L. Shepp) (1966) (0)
Covering a circle with random arcs (1970) (0)
A Course in Combinatorics: Projective and combinatorial geometries (2001) (0)
Combinatorics: Proceedings of the Advanced Study Institute on Combinatorics held at Nijenrode Castle, Breukelen , the Netherlands, July 8-20, 1974 (1974) (0)
A Course in Combinatorics: Difference sets and the group ring (2001) (0)
A Course in Combinatorics: Codes and designs (2001) (0)
Berkeley problems in mathematics / P.N. de Souza, J.-N. Silva (1999) (0)
Publications of J.H. van Lint (1992) (0)
An "offense-last-move" game against perfect local defense at targets of arbitrary values (1968) (0)
An introduction to the ICMI study on the computer and informatics (1984) (0)
Solution to Problem 4946 [1961, 67] - A summation (1962) (0)
An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes (2002) (0)
Designs, Graphs, Codes and their Links: Association schemes (1991) (0)
Extensions of graphs (1980) (0)
Solution to Problem 5019 [1962, 316] - An uncovered irrational (1963) (0)
VII. Some extremal problems (1974) (0)
Embeddings of graphs on surfaces (2001) (0)
Representation of 0 as $\sum^{N}_{k=-N} \epsilon_k k$ (1967) (0)
Introduction to special section on coding theory (1988) (0)
Solution to Problem 5016 [1962, 237] - A sequence of even polynomials (1963) (0)
The Mathematics of the CD (1998) (0)
Book Review: Algebraic-geometric codes (1992) (0)
1-factorisations of K6 (1980) (0)
III. Generating functions and recursions (1974) (0)
On the distribution of [theta] modulo 1 (1970) (0)
Special Mathematical Topics (1983) (0)
Regular two-graphs (1991) (0)
Solution to Problem E1955 [1967, 197] - Asymptotic character of a sequence (1968) (0)
A Course in Combinatorics: Orthogonal Latin squares (2001) (0)
A Course in Combinatorics: Permanents (2001) (0)
Another Sorting Problem (1960) (0)
Solution to Problem 5195 [1964, 440] - The equation y'''-p(x)y=0 (1965) (0)
Strongly regular graphs with no triangles (1975) (0)
The number of (0,1)-matrices of size n with line sums k (1986) (0)
Elementary concepts from algebraic geometry (1988) (0)
XI. Difference sets (1974) (0)
Solution to problem 10558 [1996, 902] - A matter of adjustment (1999) (0)
Protection of Software Algorithms Executed on Secure Microprocessors (1996) (0)
Graph Theory Coding Theory and Block Designs: Strongly regular graphs (1975) (0)
X. Block designs (1974) (0)
V. Distinct representatives (1974) (0)
Tertiary academic instructions (1987) (0)
Combinatorial designs and projective geometries (2001) (0)
Graphs, Codes and Designs: Threshold decoding (1980) (0)
VIII. Convex spaces (1974) (0)
Shimura curves and codes (1988) (0)
Extension of graphs (1975) (0)
A Course in Combinatorics: Gaussian numbers and q -analogues (2001) (0)
Graph Theory Coding Theory and Block Designs: Association schemes (1975) (0)
The mathematics of the compact disc (Chapter 2) (2010) (0)
Self-orthogonal codes and designs (1975) (0)
Address by J.H. van Lint at the occasion of his honorary degree at the University of Xi'an Jiaotong 1996 (1996) (0)
Book review: Winning ways for your mathematical plays (1985) (0)
Solution to Problem 61-10 : The expected value of a product (1963) (0)
Systems of distinct representatives (2001) (0)
VI. Ramsey's theorem (1974) (0)
Designs, Graphs, Codes and their Links: Quadratic residue codes and the Assmus-Mattson Theorem (1991) (0)
II. Inversion formulae (1974) (0)
XIII. Orthogonal latin squares (1974) (0)
Perfect Codes and Uniformly Packed Codes (1992) (0)
Solution to Problem 4911 [1960,596] - An extension of Picard's theorem (1961) (0)
Graphs, Codes and Designs: Preface (1980) (0)
Proofs from THE BOOK / M. Aigner, G.M. Ziegler (1999) (0)
On perfect constant weight codes (1999) (0)
Dilworth's theorem and extremal set theory (2001) (0)
A Course in Combinatorics: Electrical networks and squared squares (2001) (0)
A Course in Combinatorics: Baranyai's theorem (2001) (0)
A Course in Combinatorics: (More) algebraic techniques in graph theory (2001) (0)
Polarities of designs (1975) (0)
XV. Constructions of block designs (1974) (0)

This paper list is powered by the following services:

Other Resources About J. H. van Lint

en.wikipedia.org

What Schools Are Affiliated With J. H. van Lint?

J. H. van Lint is affiliated with the following schools:

Image Attributions

Image Source for J. H. van Lint