Binary cyclic codes generated by m1m7
IEEE Transactions on Information Theory
On the minimum distance of cyclic codes
IEEE Transactions on Information Theory
Generalized Reed-Solomon codes from algebraic geometry
IEEE Transactions on Information Theory
New upper bounds for the football pool problem for 6, 7, and 8 matches
Journal of Combinatorial Theory Series A
Distance theorems for code pairs
Proceedings of the third international conference on Combinatorial mathematics
Coding theory and design theory: part II, design theory
Coding for channels with localized errors
Beauty is our business
A class of non-embeddable designs
Journal of Combinatorial Theory Series A
Genetic algorithms in coding theory: a table for A3(n,d)
Discrete Applied Mathematics
Codes and combinatorial designs
Proceedings of the Marshall Hall conference on Coding theory, design theory, group theory
Handbook of combinatorics (vol. 1)
Protection of software algorithms executed on secure modules
Future Generation Computer Systems - Special issue on smart cards
On the number of blocks in a generalized Steiner system
Journal of Combinatorial Theory Series A
On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Journal of Combinatorial Theory Series A
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Designs, Codes and Cryptography
On Perfect Ternary Constant Weight Codes
Designs, Codes and Cryptography
Recent Results on Covering Problems
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Order Functions and Evaluation Codes
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An upper bound on the size of a code with the k-identifiable parent property
Journal of Combinatorial Theory Series A
New Results on Codes with Covering Radius 1 and Minimum Distance 2
Designs, Codes and Cryptography
XOR-based Visual Cryptography Schemes
Designs, Codes and Cryptography
Hi-index | 0.00 |
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.