Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
Foreword. Publications of J.H. van Lint. Local Search in Coding Theory. Cyclic Affine Planes and Paley Difference Sets. On the Reed-Muller Codes. A Note on Binary Cyclic Codes of Blocklength 63. List Decoding. Locally K3,3 or Petersen Graphs. Note on the Structure of Semiovals in Finite Projective Planes. On Some New Simple Perfect Squared Squares. Structure and Uniqueness of the (81,20,1,6) Strongly Regular Graph. Some 2-Ranks. An Observation on Certain Point-Line Configurations in Classical Planes. Penrose Patterns are Almost Entirely Determined by Two Points. Covering Machines. Almost All Quasigroups Have Rank 2. The Dimension of Projective Geometry Codes. Subplane Covered Nets and Semipartial Geometries. On the Number of Fixed Point Free Elements in a Permutation Group. Generalized Hexagons of Even Order. On the Covering Radius of Reed-Muller Codes. A New Authentication Scheme Based on Latin Squares. Extension Operations for Cuts. Binomial Coefficient Codes over GF(2). Some VLSI Decompositions of the de Bruijn Graph. On Spherical Codes Generating the Kissing Number in Dimensions 8 and 24. Weight Distributions for a Certain Class of Codes and Maximal Curves. Probability, Information Theory, and Prime Number Theory. Translation Nets: A Survey. Local Indecomposability of Certain Geometric Graphs. New Spherical 4-Designs. Projective Codes Meeting the Griesmer Bound. Searching with Lies: the Ulam Problem. On Simple Combinatorial Optimization Problems. On Lengthening of Covering Codes. Kerdock Codes and Related Planes. Some Fascinating Integer Sequences. Support Weight Distribution of Linear Codes. On Block Designs with Repeated Blocks. On the Inverse Fermat Equation. On Perfect Arithmetic Codes. Linear Codes with Complementary Duals. Fault-Detection in Networks. Completely Regular Codes. Orthogonal Arrays and Other Combinatorial Aspects in the Theory of Uniform Point Distributions in Unit Cubes. On Decoding by Error Location and Dependent Sets of Error Positions. Incidence Structures Applied to Cryptography. More on the Uniqueness of the Golay Codes. A Recursive Method for Construction of Designs. Some Aspects of the Information Theoretic Dialogue. Circuits in Graphs Embedded on the Torus. A Note on Path-Zero Graphs. The [18,9,6] Code is Unique. Is Taylor's Graph Geometric? Complete k-arcs in PG(n,q), q Even. On the Cardinality of Sets of Sequences with Given Maximum Correlation. Fire Codes Revisited. On the Weight Enumerator of Product Codes. Some Small Non-Embeddable Designs. On Kirkman Triple Systems of Order 33. Efficient Circuits for Multiplying in GF(2m) for Certain Values of m.
This collection of contributions is offered to Jack van Lint on the occasion of his sixtieth birthday and appears simultaneously in the series Topics in Discrete Mathematics and as a special double volume of Discrete Mathematics (Volumes 106/107). It is hoped that the papers selected, all written by experts in their own fields, represent the many interesting areas that together constitute the discipline of Discrete Mathematics. It is in this sphere that van Lint has become the acknowledged master and this expansive volume serves to demonstrate the enormous significance he has had on the development of Discrete Mathematics during the last 30 years.
- © North Holland 1992
- 4th December 1992
- North Holland
- eBook ISBN:
School of Mathematics, Queen Mary and Westfield College, London, UK
Faculty of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.