Lint, Jacobus Hendricus van 1932
Overview
Works:  272 works in 635 publications in 3 languages and 9,844 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Honoree, Thesis advisor, Illustrator 
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
)
56 editions published between 1982 and 2013 in English and held by 1,792 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
56 editions published between 1982 and 2013 in English and held by 1,792 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
)
53 editions published between 1991 and 2009 in English and Undetermined and held by 1,691 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
53 editions published between 1991 and 2009 in English and Undetermined and held by 1,691 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
Graph theory, coding theory, and block designs by
Peter J Cameron(
)
16 editions published in 1975 in English and held by 1,295 WorldCat member libraries worldwide
These are notes deriving from lecture courses given by the authors in 1973 at Westfield College, London. The lectures described the connection between the theory of tdesigns on the one hand, and graph theory on the other. A feature of this book is the discussion of thenrecent construction of tdesigns from codes. Topics from a wide range of finite combinatorics are covered and the book will interest all scholars of combinatorial theory
16 editions published in 1975 in English and held by 1,295 WorldCat member libraries worldwide
These are notes deriving from lecture courses given by the authors in 1973 at Westfield College, London. The lectures described the connection between the theory of tdesigns on the one hand, and graph theory on the other. A feature of this book is the discussion of thenrecent construction of tdesigns from codes. Topics from a wide range of finite combinatorics are covered and the book will interest all scholars of combinatorial theory
Graphs, codes, and designs by
Peter J Cameron(
)
15 editions published in 1980 in English and held by 1,289 WorldCat member libraries worldwide
This book is concerned with the relations between graphs, errorcorrecting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that nonspecialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics
15 editions published in 1980 in English and held by 1,289 WorldCat member libraries worldwide
This book is concerned with the relations between graphs, errorcorrecting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that nonspecialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics
Designs, graphs, codes, and their links by
Peter J Cameron(
)
21 editions published between 1991 and 2000 in English and held by 1,103 WorldCat member libraries worldwide
"Although design theory, graph theory and coding theory, had their origins in various areas of applied mathematics, today they are found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on designs, graphs and codes, 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 throughout, and a large number of references are given. Book jacket."BOOK JACKET
21 editions published between 1991 and 2000 in English and held by 1,103 WorldCat member libraries worldwide
"Although design theory, graph theory and coding theory, had their origins in various areas of applied mathematics, today they are found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on designs, graphs and codes, 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 throughout, and a large number of references are given. Book jacket."BOOK JACKET
Coding theory by
Jacobus Hendricus van Lint(
Book
)
37 editions published between 1970 and 2013 in 3 languages and held by 738 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
37 editions published between 1970 and 2013 in 3 languages and held by 738 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 607 WorldCat member libraries worldwide
24 editions published between 1974 and 2008 in English and Undetermined and held by 607 WorldCat member libraries worldwide
Combinatorics : proceedings of the NATO Advanced Study Institute, held at Nijenrode Castle, Breukelen, the Netherlands, 820
July 1974 by
Marshall Hall(
Book
)
31 editions published between 1974 and 1975 in English and Undetermined and held by 353 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
31 editions published between 1974 and 1975 in English and Undetermined and held by 353 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
Introduction to Coding Theory by
Jacobus Hendricus van Lint(
)
2 editions published between 1992 and 1999 in English and held by 114 WorldCat member libraries worldwide
The first edition of this book was very well received and is considered to be one of the classical introductions to the subject of discrete mathematics a field that is still growing in importance as the need for mathematiciansand computer scientists in industry continues to grow. The opening chapter is a memoryrefresher reviewing the prerequisite mathematical knowledge. The body of the book contains two parts (five chapters each): a rigorous mathematically oriented first course in coding theory, followedby introductions to special topics; these can be used as a second semester, as supplementary reading, or as preparation for studying the literature. Among the special features are chapters on arithmetic codes and convolutional codes, and exercises with complete solutions
2 editions published between 1992 and 1999 in English and held by 114 WorldCat member libraries worldwide
The first edition of this book was very well received and is considered to be one of the classical introductions to the subject of discrete mathematics a field that is still growing in importance as the need for mathematiciansand computer scientists in industry continues to grow. The opening chapter is a memoryrefresher reviewing the prerequisite mathematical knowledge. The body of the book contains two parts (five chapters each): a rigorous mathematically oriented first course in coding theory, followedby introductions to special topics; these can be used as a second semester, as supplementary reading, or as preparation for studying the literature. Among the special features are chapters on arithmetic codes and convolutional codes, and exercises with complete solutions
Cryptography and data protection : proceedings of a symposium at the Royal Netherlands Academy of Arts and Sciences on 19th
December 1990(
Book
)
7 editions published in 1992 in English and held by 61 WorldCat member libraries worldwide
7 editions published in 1992 in English and held by 61 WorldCat member libraries worldwide
Combinatorics : Proceedings by Advanced Study Institute on Combinatorics(
Book
)
3 editions published between 1974 and 1975 in English and Undetermined and held by 44 WorldCat member libraries worldwide
3 editions published between 1974 and 1975 in English and Undetermined and held by 44 WorldCat member libraries worldwide
Hecke operators and Euler products by
Jacobus Hendricus van Lint(
Book
)
6 editions published in 1957 in English and Dutch and held by 42 WorldCat member libraries worldwide
6 editions published in 1957 in English and Dutch and held by 42 WorldCat member libraries worldwide
Combinatorics : proceedings of the Advanced Study Institute on Combinatorics held at Nijenrode Castle, Breukelen, July 820,
1974 by
M Hall(
)
1 edition published in 1975 in English and held by 38 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
1 edition published in 1975 in English and held by 38 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
A Collection of contributions in honour of Jack van Lint by
Peter J Cameron(
Book
)
6 editions published in 1992 in English and held by 38 WorldCat member libraries worldwide
6 editions published in 1992 in English and held by 38 WorldCat member libraries worldwide
Coding Theory by
Jacobus Hendricus van Lint(
)
2 editions published in 1973 in English and held by 32 WorldCat member libraries worldwide
2 editions published in 1973 in English and held by 32 WorldCat member libraries worldwide
Combinatorial theory seminar, Eindhoven University of Technology by
Jacobus Hendricus van Lint(
)
1 edition published in 1974 in English and held by 27 WorldCat member libraries worldwide
1 edition published in 1974 in English and held by 27 WorldCat member libraries worldwide
Colloquium discrete wiskunde by
Jacobus Hendricus van Lint(
Book
)
4 editions published in 1968 in Dutch and held by 24 WorldCat member libraries worldwide
4 editions published in 1968 in Dutch and held by 24 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 22 WorldCat member libraries worldwide
4 editions published between 1971 and 1991 in Dutch and Undetermined and held by 22 WorldCat member libraries worldwide
The Influence of computers and informatics on mathematics and its teaching by
R. F Churchhouse(
)
2 editions published in 1986 in English and held by 18 WorldCat member libraries worldwide
First published in 1986, the first ICMI study is concerned with the influence of computers and computer science on mathematics and its teaching in the last years of school and at tertiary level. In particular, it explores the way the computer has influenced mathematics itself and the way in which mathematicians work, likely influences on the curriculum of highschool and undergraduate students, and the way in which the computer can be used to improve mathematics teaching and learning. The book comprises a report of the meeting held in Strasbourg in March 1985, plus several papers contributed to that meeting
2 editions published in 1986 in English and held by 18 WorldCat member libraries worldwide
First published in 1986, the first ICMI study is concerned with the influence of computers and computer science on mathematics and its teaching in the last years of school and at tertiary level. In particular, it explores the way the computer has influenced mathematics itself and the way in which mathematicians work, likely influences on the curriculum of highschool and undergraduate students, and the way in which the computer can be used to improve mathematics teaching and learning. The book comprises a report of the meeting held in Strasbourg in March 1985, plus several papers contributed to that meeting
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
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
 Technische Hogeschool Eindhoven
 Hall, Marshall 19101990 Other Author Editor
 Geer, Gerard van der Editor
 North Atlantic Treaty Organization
 Tijdeman, R. Other Editor
 Hall, M. Author Editor
 Tilborg, Henk C. A. van 1947
 SpringerLink (Service en ligne)
Useful Links
Associated Subjects
Algebra Algorithms Block designs Coding theory Combinations Combinatorial analysis Combinatorial designs and configurations Computers Computer scienceMathematics Computer security Cryptography Experimental design Geometry, Algebraic Graph theory Logic programming Mathematical analysis Mathematics MathematicsComputerassisted instruction MathematicsStudy and teaching MathematicsStudy and teaching (Higher)Data processing Matrices Matroids Modular functions Number theory Polyominoes
Covers
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 I.H. van
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 I.H.
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
Ван Линт, Дж..
Линт Дж. ван
リント, J. H. ヴァン
Languages