One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.

This book constitutes the refereed proceedings of the Third International Conference on Algebraic Informatics, CAI 2009, held in Thessaloniki, Greece, in May 2009. The 16 full papers were carefully reviewed and selected from 25 submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, algebraic aspects of cryptography.

This book, the first volume of a subseries on "Invariant Theory and Algebraic Transformation Groups", provides a comprehensive and up-to-date overview of the algorithmic aspects of invariant theory. Numerous illustrative examples and a careful selection of proofs make the book accessible to non-specialists.

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

Using an original mode of presentation, and emphasizing the computational nature of the subject, this book explores a number of the unsolved problems that still exist in coding theory. A well-established and highly relevant branch of mathematics, the theory of error-correcting codes is concerned with reliably transmitting data over a ‘noisy’ channel. Despite frequent use in a range of contexts, the subject still contains interesting unsolved problems that have resisted solution by some of the most prominent mathematicians of recent decades. Employing Sage—a free open-source mathematics software system—to illustrate ideas, this book is intended for graduate students and researchers in algebraic coding theory. The work may be used as supplementary reading material in a graduate course on coding theory or for self-study.

This book is about the computational aspects of invariant theory. Of central interest is the question how the invariant ring of a given group action can be calculated. Algorithms for this purpose form the main pillars around which the book is built. There are two introductory chapters, one on Gröbner basis methods and one on the basic concepts of invariant theory, which prepare the ground for the algorithms. Then algorithms for computing invariants of finite and reductive groups are discussed. Particular emphasis lies on interrelations between structural properties of invariant rings and computational methods. Finally, the book contains a chapter on applications of invariant theory, covering fields as disparate as graph theory, coding theory, dynamical systems, and computer vision. The book is intended for postgraduate students as well as researchers in geometry, computer algebra, and, of course, invariant theory. The text is enriched with numerous explicit examples which illustrate the theory and should be of more than passing interest. More than ten years after the first publication of the book, the second edition now provides a major update and covers many recent developments in the field. Among the roughly 100 added pages there are two appendices, authored by Vladimi r Popov, and an addendum by Norbert A'Campo and Vladimir Popov.

An introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory. In concluding sections, related topics, including parallel quantum computation, are discussed.

-Proceedings of the NATO Advanced Study Institute on New Challenges in Digital Communications, Vlora, Albania, 27 April - 9 May 2008.---T.p. verso.

This book is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to research ideas, hints for applications, outlines and details of algorithms, examples and problems.

Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user has no information about the secret, but the secret can be retrieved by certain authorized coalition of users.This book is devoted to such schemes inspired by Coding Theory. The classical schemes of Shamir, Blakley, Massey are recalled. Survey is made of research in Combinatorial Coding Theory they triggered, mostly self-dual codes, and minimal codes. Applications to engineering like image processing, and key management of MANETs are highlighted.