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)

This book had its origins in the NATO Advanced Study Institute (ASI) held in Ohrid, Macedonia, in 2014. The focus of this ASI was the arithmetic of superelliptic curves and their application in different scientific areas, including whether all the applications of hyperelliptic curves, such as cryptography, mathematical physics, quantum computation and diophantine geometry, can be carried over to the superelliptic curves. Additional papers have been added which provide some background for readers who were not at the conference, with the intention of making the book logically more complete and easier to read, but familiarity with the basic facts of algebraic geometry, commutative algebra and number theory are assumed. The book is divided into three sections. The first part deals with superelliptic curves with regard to complex numbers, the automorphisms group and the corresponding Hurwitz loci. The second part of the book focuses on the arithmetic of the subject, while the third addresses some of the applications of superelliptic curves.

"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"--

This text offers an introduction to error-correcting linear codes for researchers and graduate students in mathematics, computer science and engineering. The book differs from other standard texts in its emphasis on the classification of codes by means of isometry classes. The relevant algebraic are developed rigorously. Cyclic codes are discussed in great detail. In the last four chapters these isometry classes are enumerated, and representatives are constructed algorithmically.

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.

This book surveys state-of-the-art optimization modeling for design, analysis, and management of wireless networks, such as cellular and wireless local area networks (LANs), and the services they deliver. The past two decades have seen a tremendous growth in the deployment and use of wireless networks. The current-generation wireless systems can provide mobile users with high-speed data services at rates substantially higher than those of the previous generation. As a result, the demand for mobile information services with high reliability, fast response times, and ubiquitous connectivity continues to increase rapidly. The optimization of system performance has become critically important both in terms of practical utility and commercial viability, and presents a rich area for research. In the editors' previous work on traditional wired networks, we have observed that designing low cost, survivable telecommunication networks involves extremely complicated processes. Commercial products available to help with this task typically have been based on simulation and/or proprietary heuristics. As demonstrated in this book, however, mathematical programming deserves a prominent place in the designer's toolkit. Convenient modeling languages and powerful optimization solvers have greatly facilitated the implementation of mathematical programming theory into the practice of commercial network design. These points are equally relevant and applicable in today’s world of wireless network technology and design. But there are new issues as well: many wireless network design decisions, such as routing and facility/element location, must be dealt with in innovative ways that are unique and distinct from wired (fiber optic) networks. The book specifically treats the recent research and the use of modeling languages and network optimization techniques that are playing particularly important and distinctive roles in the wireless domain.

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.