This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest.

Codes, Curves, and Signals: Common Threads in Communications is a collection of seventeen contributions from leading researchers in communications. The book provides a representative cross-section of cutting edge contemporary research in the fields of algebraic curves and the associated decoding algorithms, the use of signal processing techniques in coding theory, and the application of information-theoretic methods in communications and signal processing. The book is organized into three parts: Curves and Codes, Codes and Signals, and Signals and Information. Codes, Curves, and Signals: Common Threads in Communications is a tribute to the broad and profound influence of Richard E. Blahut on the fields of algebraic coding, information theory, and digital signal processing. All the contributors have individually and collectively dedicated their work to R. E. Blahut. Codes, Curves, and Signals: Common Threads in Communications is an excellent reference for researchers and professionals.

This series is devoted to the publication of high-level monographs which cover the whole spectrum of current discrete mathematics and its applications in various fields. One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of discrete mathematics. Contributions which are on the borderline of discrete mathematics and related fields and which stimulate further research at the crossroads of these areas are particularly welcome.

The last few years have witnessed rapid advancements in information and coding theory research and applications. This book provides a comprehensive guide to selected topics, both ongoing and emerging, in information and coding theory. Consisting of contributions from well-known and high-profile researchers in their respective specialties, topics that are covered include source coding; channel capacity; linear complexity; code construction, existence and analysis; bounds on codes and designs; space-time coding; LDPC codes; and codes and cryptography.All of the chapters are integrated in a manner that renders the book as a supplementary reference volume or textbook for use in both undergraduate and graduate courses on information and coding theory. As such, it will be a valuable text for students at both undergraduate and graduate levels as well as instructors, researchers, engineers, and practitioners in these fields.Supporting Powerpoint Slides are available upon request for all instructors who adopt this book as a course text.

Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections to physics occur within areas like crystallography and nuclear physics. In engineering spherical codes are of central importance in connection with error-control in communication systems. In that context the use of spherical codes is often referred to as "coded modulation." The book offers a first complete treatment of the mathematical theory of codes on Euclidean spheres. Many new results are published here for the first time. Engineering applications are emphasized throughout the text. The theory is illustrated by many examples. The book also contains an extensive table of best known spherical codes in dimensions 3-24, including exact constructions.

Contains the Proceedings of an International Conference on Noncommutative Rings and Their Applications, held July 1-4, 2013, at the Universite d'Artois, Lens, France. It presents recent developments in the theories of noncommutative rings and modules over such rings as well as applications of these to coding theory, enveloping algebras, and Leavitt path algebras.

This book provides a comprehensive introduction to modern global variational theory on fibred spaces. It is based on differentiation and integration theory of differential forms on smooth manifolds, and on the concepts of global analysis and geometry such as jet prolongations of manifolds, mappings, and Lie groups. The book will be invaluable for researchers and PhD students in differential geometry, global analysis, differential equations on manifolds, and mathematical physics, and for the readers who wish to undertake further rigorous study in this broad interdisciplinary field. Featured topics- Analysis on manifolds- Differential forms on jet spaces - Global variational functionals- Euler-Lagrange mapping - Helmholtz form and the inverse problem- Symmetries and the Noether's theory of conservation laws- Regularity and the Hamilton theory- Variational sequences - Differential invariants and natural variational principles- First book on the geometric foundations of Lagrange structures- New ideas on global variational functionals - Complete proofs of all theorems - Exact treatment of variational principles in field theory, inc. general relativity- Basic structures and tools: global analysis, smooth manifolds, fibred spaces

The theory developed for Z2Z4-additive codes is the starting point for much generalization about codes over mixed alphabets. They have opened a new, emergent area of research. The techniques used for Z2Z4-linear codes are being generalized and applied to more general codes. By example, these codes have contributed to the classification of many nonlinear codes. Moreover, they can be considered as the starting point of many different generalizations given over mixed alphabets, thereby representing a useful area of research. Since 2010, more than 30 papers have been published about the codes considered in the book, which includes important classes of binary codes (1-perfect, Hadamard, etc.) that are not linear in general. For example, much recent research has shown the application of the techniques described for the family of cyclic Z2Z4-linear codes. Topics and Features: Examines everything from the basic definitions to very advanced results Provides numerous examples, succinctly and comprehensively gathering and using the relevant information Includes examples using commands from a new Magma package, developed mostly by the same authors Proposes algorithms, for instance to describe coding and decoding strategies This unique volume will be eminently suitable for researchers working on coding theory over rings, especially over mixed alphabets. Experts will find commands and algorithms that will be useful in the generalization to codes over mixed alphabets. Additionally, by outlining the basic theory of codes over mixed alphabets and providing numerous examples, the book will be useful to researchers wanting to be introduced to the topic. The authors are all affiliated with the Dept. of Information and Communications Engineering at the Universitat Autònoma de Barcelona, Spain. Joaquim Borges and Cristina Fernández-Córdoba are Associate Professors, Jaume Pujol is a now retired Associate Professor, Josep Rifà is Professor Emeritus, and Mercè Villanueva is Associate Professor.

This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.