Since the publication of the first edition of this monograph, a generalisation of the Assmus-Mattson theorem for linear codes over finite fields has been developed, two 70-year breakthroughs and a considerable amount of other progress on t-designs from linear codes have been made. This second edition is a substantial revision and expansion of the first edition. Two new chapters and two new appendices have been added, and most chapters of the first edition have been revised.It provides a well-rounded and detailed account of t-designs from linear codes. Most chapters of this book cover the support designs of linear codes. A few chapters deal with designs obtained from linear codes in other ways. Connections among ovals, hyperovals, maximal arcs, ovoids, special functions, linear codes and designs are also investigated. This book consists of both classical and recent results on designs from linear codes.It is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications, or finite geometry. It can also be used as a textbook for postgraduates in these subject areas.Related Link(s)

Written by one of the top experts in the fields of combinatorics and representation theory, this book distinguishes itself from the existing literature by its applications-oriented point of view. The second edition is extended, placing more emphasis on applications to the constructive theory of finite structures. Recent progress in this field, in particular in design and coding theory, is described.

Bringing together both new and old results, Theory of Factorial Design: Single- and Multi-Stratum Experiments provides a rigorous, systematic, and up-to-date treatment of the theoretical aspects of factorial design. To prepare readers for a general theory, the author first presents a unified treatment of several simple designs, including completely randomized designs, block designs, and row-column designs. As such, the book is accessible to readers with minimal exposure to experimental design. With exercises and numerous examples, it is suitable as a reference for researchers and as a textbook for advanced graduate students. In addition to traditional topics and a thorough discussion of the popular minimum aberration criterion, the book covers many topics and new results not found in existing books. These include results on the structures of two-level resolution IV designs, methods for constructing such designs beyond the familiar foldover method, the extension of minimum aberration to nonregular designs, the equivalence of generalized minimum aberration and minimum moment aberration, a Bayesian approach, and some results on nonregular designs. The book also presents a theory that provides a unifying framework for the design and analysis of factorial experiments with multiple strata (error terms) arising from complicated structures of the experimental units. This theory can be systematically applied to various structures of experimental units instead of treating each on a case-by-case basis.

This book guides readers through the design of hardware architectures using VHDL for digital communication and image processing applications that require performance computing. Further it includes the description of all the VHDL-related notions, such as language, levels of abstraction, combinational vs. sequential logic, structural and behavioral description, digital circuit design, and finite state machines. It also includes numerous examples to make the concepts presented in text more easily understandable.

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence

The explanation of the formal duality of Kerdock and Preparata codes is one of the outstanding results in the field of applied algebra in the last few years. This result is related to the discovery of large sets of quad riphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. Moreover, the correlation properties of sequences are closely related to difference properties of certain sets in (cyclic) groups. It is the purpose of this book to illustrate the connection between these three topics. Most articles grew out of lectures given at the NATO Ad vanced Study Institute on "Difference sets, sequences and their correlation properties". This workshop took place in Bad Windsheim (Germany) in August 1998. The editors thank the NATO Scientific Affairs Division for the generous support of this workshop. Without this support, the present collection of articles would not have been realized.

This book is designed to be usable as a textbook for an undergraduate course or for an advanced graduate course in coding theory as well as a reference for researchers in discrete mathematics, engineering and theoretical computer science. This second edition has three parts: an elementary introduction to coding, theory and applications of codes, and algebraic curves. The latter part presents a brief introduction to the theory of algebraic curves and its most important applications to coding theory.

In the new era of technology and advanced communications, coding theory and cryptography play a particularly significant role with a huge amount of research being done in both areas. This book presents some of that research, authored by prominent experts in the field.The book contains articles from a variety of topics most of which are from coding theory. Such topics include codes over order domains, Groebner representation of linear codes, Griesmer codes, optical orthogonal codes, lattices and theta functions related to codes, Goppa codes and Tschirnhausen modules, s-extremal codes, automorphisms of codes, etc. There are also papers in cryptography which include articles on extremal graph theory and its applications in cryptography, fast arithmetic on hyperelliptic curves via continued fraction expansions, etc. Researchers working in coding theory and cryptography will find this book an excellent source of information on recent research.

"Published in cooperation with NATO Emerging Security Challenges Division"--T.p.

A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.