N.J.A. Sloane

J.H. Conway

The second edition of this timely, definitive, and popular book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to examine related problems such as the kissing number problem, the covering problem, the quantizing problem, and the classification of lattices and quadratic forms. Like the first edition, the second edition describes the applications of these questions to other areas of mathematics and science such as number theory, coding theory, group theory, analog-to-digital conversion and data compression, n-dimensional crystallography, and dual theory and superstring theory in physics. Results as of 1992 have been added to the text, and the extensive bibliography - itself a contribution to the field - is supplemented with approximately 450 new entries.

Sphere Packings, Lattices and Groups

John Stufken

A.S. Hedayat

This is the first book on the subject since its introduction more than fifty years ago, and it can be used as a graduate text or as a reference work. It features all of the key results, many very useful tables, and a large number of research problems. Contents: Intro.; Rao's inequalities and improvements; Orthogonal arrays and Galois fields; Orthogonal arrays and error-correcting codes; Construction of orthogonal arrays from codes; Orthogonal arrays and difference schemes;.

Theory and Applications

Orthogonal Arrays

Orthogonal arrays have played a vital role in improving the quality of products manufactured throughout the world. This first book on the subject since its introduction more than fifty years ago serves as a key resource to this area of designing experiments. Most of the arrays obtained by the methods in this book are available electronically. Anyone running experiments - whether in a chemistry lab or a manufacturing plant, or in agricultural or medical research - will find this book useful.

N.J.A. Sloane

About

Books

Join the club