Lint, Jacobus Hendricus van 1932
Overview
Works:  312 works in 695 publications in 4 languages and 9,584 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Honoree, Illustrator, Thesis advisor 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works about
Jacobus Hendricus van Lint
Most widely held works by
Jacobus Hendricus van Lint
Introduction to coding theory by
Jacobus Hendricus van Lint(
Book
)
68 editions published between 1982 and 2013 in English and Undetermined and held by 1,646 WorldCat member libraries worldwide
These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 1621, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the GilbertVarshamov bound. The result was considered sensational. Furthermore, it was surprising to see these unrelated areas of mathematics collaborating. The aim of this course is to give an introduction to coding theory and to sketch the ideas of algebraic geometry that led to the new result. Finally, a number of applications of these methods of algebraic geometry to coding theory are given. Since this is a new area, there are presently no references where one can find a more extensive treatment of all the material. However, both for algebraic geometry and for coding theory excellent textbooks are available. The combination ofthe two subjects can only be found in a number ofsurvey papers. A book by C. Moreno with a complete treatment of this area is in preparation. We hope that these notes will stimulate further research and collaboration of algebraic geometers and coding theorists. G. van der Geer, J.H. van Lint Introduction to CodingTheory and Algebraic Geometry PartI  CodingTheory Jacobus H. vanLint 11 1. Finite fields In this chapter we collect (without proof) the facts from the theory of finite fields that we shall need in this course
68 editions published between 1982 and 2013 in English and Undetermined and held by 1,646 WorldCat member libraries worldwide
These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 1621, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the GilbertVarshamov bound. The result was considered sensational. Furthermore, it was surprising to see these unrelated areas of mathematics collaborating. The aim of this course is to give an introduction to coding theory and to sketch the ideas of algebraic geometry that led to the new result. Finally, a number of applications of these methods of algebraic geometry to coding theory are given. Since this is a new area, there are presently no references where one can find a more extensive treatment of all the material. However, both for algebraic geometry and for coding theory excellent textbooks are available. The combination ofthe two subjects can only be found in a number ofsurvey papers. A book by C. Moreno with a complete treatment of this area is in preparation. We hope that these notes will stimulate further research and collaboration of algebraic geometers and coding theorists. G. van der Geer, J.H. van Lint Introduction to CodingTheory and Algebraic Geometry PartI  CodingTheory Jacobus H. vanLint 11 1. Finite fields In this chapter we collect (without proof) the facts from the theory of finite fields that we shall need in this course
A course in combinatorics by
Jacobus Hendricus van Lint(
Book
)
52 editions published between 1991 and 2009 in 3 languages and held by 1,078 WorldCat member libraries worldwide
This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject
52 editions published between 1991 and 2009 in 3 languages and held by 1,078 WorldCat member libraries worldwide
This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject
Coding theory by
Jacobus Hendricus van Lint(
Book
)
39 editions published between 1969 and 2008 in 3 languages and held by 570 WorldCat member libraries worldwide
These lecture notes are the contents of a twoterm course given by me during the 19701971 academic year as Morgan Ward visiting professor at the California Institute of Technology. The students who took the course were mathematics seniors and graduate students. Therefore a thorough knowledge of algebra. (a. o. linear algebra, theory of finite fields, characters of abelian groups) and also probability theory were assumed. After introducing coding theory and linear codes these notes concern topics mostly from algebraic coding theory. The practical side of the subject, e. g. circuitry, is not included. Some topics which one would like to include 1n a course for students of mathematics such as bounds on the information rate of codes and many connections between combinatorial mathematics and coding theory could not be treated due to lack of time. For an extension of the course into a third term these two topics would have been chosen. Although the material for this course came from many sources there are three which contributed heavily and which were used as suggested reading material for the students. These are W.W. Peterson's ErrorCorrecting Codes ±(15]), E.R. Berlekamp's Algebraic Coding Theory ±(5]) and several of the AFCRLreports by E.F. Assmus, H.F. Mattson and R. Turyn ([2], (3), [4] a. o.). For several fruitful discussions I would like to thank R.J. McEliece
39 editions published between 1969 and 2008 in 3 languages and held by 570 WorldCat member libraries worldwide
These lecture notes are the contents of a twoterm course given by me during the 19701971 academic year as Morgan Ward visiting professor at the California Institute of Technology. The students who took the course were mathematics seniors and graduate students. Therefore a thorough knowledge of algebra. (a. o. linear algebra, theory of finite fields, characters of abelian groups) and also probability theory were assumed. After introducing coding theory and linear codes these notes concern topics mostly from algebraic coding theory. The practical side of the subject, e. g. circuitry, is not included. Some topics which one would like to include 1n a course for students of mathematics such as bounds on the information rate of codes and many connections between combinatorial mathematics and coding theory could not be treated due to lack of time. For an extension of the course into a third term these two topics would have been chosen. Although the material for this course came from many sources there are three which contributed heavily and which were used as suggested reading material for the students. These are W.W. Peterson's ErrorCorrecting Codes ±(15]), E.R. Berlekamp's Algebraic Coding Theory ±(5]) and several of the AFCRLreports by E.F. Assmus, H.F. Mattson and R. Turyn ([2], (3), [4] a. o.). For several fruitful discussions I would like to thank R.J. McEliece
Combinatorial theory seminar, Eindhoven University of Technology by
Jacobus Hendricus van Lint(
Book
)
24 editions published between 1974 and 2008 in English and Undetermined and held by 441 WorldCat member libraries worldwide
24 editions published between 1974 and 2008 in English and Undetermined and held by 441 WorldCat member libraries worldwide
Graph theory, coding theory, and block designs by
Peter J Cameron(
Book
)
17 editions published in 1975 in English and Undetermined and held by 439 WorldCat member libraries worldwide
These are notes deriving from lecture courses on the theory of tdesigns and graph theory given by the authors in 1973 at Westfield College, London
17 editions published in 1975 in English and Undetermined and held by 439 WorldCat member libraries worldwide
These are notes deriving from lecture courses on the theory of tdesigns and graph theory given by the authors in 1973 at Westfield College, London
Graphs, codes, and designs by
Peter J Cameron(
Book
)
18 editions published in 1980 in English and held by 428 WorldCat member libraries worldwide
This book is concerned with the relations between graphs, errorcorrecting codes and designs
18 editions published in 1980 in English and held by 428 WorldCat member libraries worldwide
This book is concerned with the relations between graphs, errorcorrecting codes and designs
Combinatorics : proceedings of the NATO Advanced Study Institute, held at Nijenrode Castle, Breukelen, the Netherlands, 820
July 1974 by
Marshall Hall(
Book
)
55 editions published between 1974 and 1975 in English and Undetermined and held by 406 WorldCat member libraries worldwide
Combinatorics has come of age. It had its beginnings in a number of puzzles which have still not lost their charm. Among these are EULER'S problem of the 36 officers and the KONIGSBERG bridge problem, BACHET's problem of the weights, and the Reverend T.P. KIRKMAN'S problem of the schoolgirls. Many of the topics treated in ROUSE BALL'S Recreational Mathe matics belong to combinatorial theory. All of this has now changed. The solution of the puzzles has led to a large and sophisticated theory with many complex ramifications. And it seems probable that the four color problem will only be solved in terms of as yet undiscovered deep results in graph theory. Combinatorics and the theory of numbers have much in common. In both theories there are many prob lems which are easy to state in terms understandable by the layman, but whose solution depends on complicated and abstruse methods. And there are now interconnections between these theories in terms of which each enriches the other. Combinatorics includes a diversity of topics which do however have interrelations in superficially unexpected ways. The instructional lectures included in these proceedings have been divided into six major areas: 1. Theory of designs; 2. Graph theory; 3. Combinatorial group theory; 4. Finite geometry; 5. Foundations, partitions and combinatorial geometry; 6. Coding theory. They are designed to give an overview of the classical foundations of the subjects treated and also some indication of the present frontiers of research
55 editions published between 1974 and 1975 in English and Undetermined and held by 406 WorldCat member libraries worldwide
Combinatorics has come of age. It had its beginnings in a number of puzzles which have still not lost their charm. Among these are EULER'S problem of the 36 officers and the KONIGSBERG bridge problem, BACHET's problem of the weights, and the Reverend T.P. KIRKMAN'S problem of the schoolgirls. Many of the topics treated in ROUSE BALL'S Recreational Mathe matics belong to combinatorial theory. All of this has now changed. The solution of the puzzles has led to a large and sophisticated theory with many complex ramifications. And it seems probable that the four color problem will only be solved in terms of as yet undiscovered deep results in graph theory. Combinatorics and the theory of numbers have much in common. In both theories there are many prob lems which are easy to state in terms understandable by the layman, but whose solution depends on complicated and abstruse methods. And there are now interconnections between these theories in terms of which each enriches the other. Combinatorics includes a diversity of topics which do however have interrelations in superficially unexpected ways. The instructional lectures included in these proceedings have been divided into six major areas: 1. Theory of designs; 2. Graph theory; 3. Combinatorial group theory; 4. Finite geometry; 5. Foundations, partitions and combinatorial geometry; 6. Coding theory. They are designed to give an overview of the classical foundations of the subjects treated and also some indication of the present frontiers of research
Designs, graphs, codes, and their links by
Peter J Cameron(
Book
)
22 editions published between 1991 and 2000 in English and held by 385 WorldCat member libraries worldwide
Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given
22 editions published between 1991 and 2000 in English and held by 385 WorldCat member libraries worldwide
Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given
Cryptography and data protection : proceedings of a symposium at the Royal Netherlands Academy of Arts and Sciences on 19th
December 1990(
Book
)
10 editions published in 1992 in English and Undetermined and held by 72 WorldCat member libraries worldwide
10 editions published in 1992 in English and Undetermined and held by 72 WorldCat member libraries worldwide
Hecke operators and Euler products by
Jacobus Hendricus van Lint(
Book
)
9 editions published in 1957 in English and Dutch and held by 43 WorldCat member libraries worldwide
9 editions published in 1957 in English and Dutch and held by 43 WorldCat member libraries worldwide
A Collection of contributions in honour of Jack van Lint by
Peter J Cameron(
Book
)
8 editions published in 1992 in English and Undetermined and held by 40 WorldCat member libraries worldwide
8 editions published in 1992 in English and Undetermined and held by 40 WorldCat member libraries worldwide
Coding Theory by
Jacobus Hendricus van Lint(
)
2 editions published in 1973 in English and held by 31 WorldCat member libraries worldwide
2 editions published in 1973 in English and held by 31 WorldCat member libraries worldwide
Colloquium discrete wiskunde by
Jacobus Hendricus van Lint(
Book
)
4 editions published in 1968 in Dutch and held by 23 WorldCat member libraries worldwide
4 editions published in 1968 in Dutch and held by 23 WorldCat member libraries worldwide
Discrete wiskunde by
Jacobus Hendricus van Lint(
Book
)
4 editions published between 1971 and 1991 in Dutch and Undetermined and held by 20 WorldCat member libraries worldwide
4 editions published between 1971 and 1991 in Dutch and Undetermined and held by 20 WorldCat member libraries worldwide
Algebra en analyse by
S. T. M Ackermans(
Book
)
4 editions published between 1970 and 1976 in Dutch and held by 18 WorldCat member libraries worldwide
4 editions published between 1970 and 1976 in Dutch and held by 18 WorldCat member libraries worldwide
A course in combinatronics by
Jacobus Hendricus van Lint(
Book
)
3 editions published in 2001 in English and held by 15 WorldCat member libraries worldwide
3 editions published in 2001 in English and held by 15 WorldCat member libraries worldwide
Papers dedicated to J.J. Seidel(
Book
)
5 editions published in 1984 in 3 languages and held by 15 WorldCat member libraries worldwide
5 editions published in 1984 in 3 languages and held by 15 WorldCat member libraries worldwide
Een blik in de getaltheorie by
Jacobus Hendricus van Lint(
Book
)
2 editions published in 1959 in Dutch and held by 12 WorldCat member libraries worldwide
2 editions published in 1959 in Dutch and held by 12 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Cameron, Peter J. (Peter Jephson) 1947 Author Editor
 Wilson, R. M. (Richard Michael) 1945
 Hall, Marshall 19101990 Author Editor
 Technische Hogeschool Eindhoven
 Geer, Gerard van der Editor
 North Atlantic Treaty Organization
 Tijdeman, R. Other
 Tilborg, Henk C. A. van 1947
 SpringerLink (Service en ligne)
 Baayen, P. C.
Useful Links
Associated Subjects
Algebra Block designs Coding theory Combinations Combinatorial analysis Combinatorial designs and configurations Computer security Cryptography Experimental design Geometry, Algebraic Graph theory Logic programming Mathematical analysis Mathematics Matrices Matroids Modular functions Number theory Polyominoes Seidel, J. J.(Johan Jacob)
Alternative Names
Jack van Lint
Jack van Lint Dutch mathematician
Jack van Lint matemático neerlandés
Jacobus Hendricus van Lint
Jacobus van Lint mathématicien néerlandais
Jacobus van Lint niederländischer Mathematiker
Lint, Dž. van.
Lint, Dž. van 19322004
Lint, H. van 1932
Lint, H. van (Jacobus Hendricus van), 1932
Lint, J. H.
Lint, J. H. Author
Lint, J. H. van.
Lint, J. H. van 1932
Lint, J. H. van 19322004
Lint, J. H. van Author
Lint, J. H. van (Jacobus Hendricus)
Lint, J. H. van (Jacobus Hendricus), 1932
Lint, J. H. van (Jacobus Hendricus van), 1932
Lint, J. van
Lint, Jack van
Lint, Jack van 1932
Lint, Jack van 19322004
Lint, Jacobus H. Author
Lint, Jacobus H. van.
Lint, Jacobus H. van 19322004
Lint, Jacobus Hendricus van
Lint, Jacobus Hendricus van 1932
Lint, Jacobus Hendricus van, 19322004
Lint, Jacobus Hendricus van Author
Van Lint, J. 19322004
Van Lint, J. H.
Van Lint, J. H. 19322004
Van Lint, J. H. (Jacobus Hendricus), 19322004
Van Lint, Jack 19322004
Van Lint, Jacobus H. 1932
Van Lint, Jacobus H. 19322004
Van Lint, Jacobus H. (Jacobus Hendricus), 1932
Van Lint Jacobus Hendricus
Van Lint, Jacobus Hendricus 1932
Van Lint, Jacobus Hendricus 19322004
VanLint, J. H. 19322004
VanLint, Jacobus H. 19322004
VanLint, Jacobus Hendricus 19322004
Ван Линт, Дж..
Languages
Covers