Selected Unsolved Problems In Coding Theory

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.

Pt. 1. Applications of coding theory to computational complexity. ch. 1. Linear complexity and related complexity measures / Arne Winterhof. ch. 2. Lattice and construction of high coding gain lattices from codes / Mohammd-Reza Sadeghi. ch. 3. Distributed space-time codes with low ML decoding complexity / G. Susinder Rajan and B. Sundar Rajan -- pt. 2. Methods of algebraic combinatorics in coding theory/codes construction and existence. ch. 4. Coding theory and algebraic combinatorics / Michael Huber. ch. 5. Block codes from matrix and group rings / Paul Hurley and Ted Hurley. ch. 6. LDPC and convolutional codes from matrix and group rings / Paul Hurley and Ted Hurley. ch. 7. Search for good linear codes in the class of quasi-cyclic and related codes / Nuh Aydin and Tsvetan Asamov -- pt. 3. Source coding/channel capacity/network coding. ch. 8. Applications of universal source coding to statistical analysis of time series / Boris Ryabko. ch. 9. Introduction to network coding for acyclic and cyclic networks / Ángela I. Barbero and Øyvind Ytrehus. ch. 10. Distributed joint source-channel coding on a multiple access channel / Vinod Sharma and R. Rajesh -- pt. 4. Other selected topics in information and coding theory. ch. 11. Low-density parity-check codes and the related performance analysis methods / Xudong Ma. ch. 12. Variable length codes and finite automata / Marie-Pierre Béal [und weitere]. ch. 13. Decoding and finding the minimum distance with Gröbner Bases : history and new insights / Stanislav Bulygin and Ruud Pellikaan. ch. 14. Cooperative diversity systems for wireless communication / Murat Uysal and Muhammad Mehboob Fareed. ch. 15. Public key cryptography and coding theory / Pascal Véron

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.

Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole bunch of non trivial knowledge of algebra and geometry that will be used to both, evaluate those methods and search for new codes and cryptographic applications. This book shows those methods in a self-contained form.

This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards advanced undergraduate and graduate students and is particularly useful for those trying to decide what type of problem to tackle for their dissertation. This book can also serve as a reference for anyone interested in exploring how they can apply graph theory to other parts of mathematics.

Features Suitable for anyone with an interest in games and mathematics. Could be especially useful to middle and high school students and their teachers Partial solutions to the various exercises included in the book.

This volume 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. Material from the course ``Foundations of Algebraic Coding Theory``, given by Steven Dougherty, is included and provides the reader with the history and background of coding theory as well as the interplay between coding theory and algebra. In module theory, many new results related to (almost) injective modules, injective hulls and automorphism-invariant modules are presented. Broad generalizations of classical projective covers are studied and category theory is used to describe the structure of some modules. In some papers related to more classical ring theory such as quasi duo rings or clean elements, new points of view on classical conjectures and standard open problems are given. Descriptions of codes over local commutative Frobenius rings are discussed, and a list of open problems in coding theory is presented within their context.