Error Correcting Codes


Book Description

Assuming little previous mathematical knowledge, Error Correcting Codes provides a sound introduction to key areas of the subject. Topics have been chosen for their importance and practical significance, which Baylis demonstrates in a rigorous but gentle mathematical style.Coverage includes optimal codes; linear and non-linear codes; general techniques of decoding errors and erasures; error detection; syndrome decoding, and much more. Error Correcting Codes contains not only straight maths, but also exercises on more investigational problem solving. Chapters on number theory and polynomial algebra are included to support linear codes and cyclic codes, and an extensive reminder of relevant topics in linear algebra is given. Exercises are placed within the main body of the text to encourage active participation by the reader, with comprehensive solutions provided.Error Correcting Codes will appeal to undergraduate students in pure and applied mathematical fields, software engineering, communications engineering, computer science and information technology, and to organizations with substantial research and development in those areas.




Fundamentals of Classical and Modern Error-Correcting Codes


Book Description

An accessible textbook that uses step-by-step explanations, relatively easy mathematics and numerous examples to aid student understanding.




A Course in Error-correcting Codes


Book Description

This book is written as a text for a course aimed at advanced undergraduates. Chapters cover the codes and decoding methods that are currently of most interest in research, development, and application. They give a relatively brief presentation of the essential results, emphasizing the interrelations between different methods and proofs of all important results. A sequence of problems at the end of each chapter serves to review the results and give the student an appreciation of the concepts.




Block Error-Correcting Codes


Book Description

Error-correcting codes have been incorporated in numerous working communication and memory systems. This book covers the mathematical aspects of the theory of block error-correcting codes together, in mutual reinforcement, with computational discussions, implementations and examples of all relevant concepts, functions and algorithms. This combined approach facilitates the reading and understanding of the subject. The digital companion of the book is a non-printable .pdf document with hyperlinks. The examples included in the book can be run with just a mouse click and modified and saved by users for their own purpose.




A Course in Algebraic Error-Correcting Codes


Book Description

This textbook provides a rigorous mathematical perspective on error-correcting codes, starting with the basics and progressing through to the state-of-the-art. Algebraic, combinatorial, and geometric approaches to coding theory are adopted with the aim of highlighting how coding can have an important real-world impact. Because it carefully balances both theory and applications, this book will be an indispensable resource for readers seeking a timely treatment of error-correcting codes. Early chapters cover fundamental concepts, introducing Shannon’s theorem, asymptotically good codes and linear codes. The book then goes on to cover other types of codes including chapters on cyclic codes, maximum distance separable codes, LDPC codes, p-adic codes, amongst others. Those undertaking independent study will appreciate the helpful exercises with selected solutions. A Course in Algebraic Error-Correcting Codes suits an interdisciplinary audience at the Masters level, including students of mathematics, engineering, physics, and computer science. Advanced undergraduates will find this a useful resource as well. An understanding of linear algebra is assumed.







A First Course in Coding Theory


Book Description

Algebraic coding theory is a new and rapidly developing subject, popular for its many practical applications and for its fascinatingly rich mathematical structure. This book provides an elementary yet rigorous introduction to the theory of error-correcting codes. Based on courses given by the author over several years to advanced undergraduates and first-year graduated students, this guide includes a large number of exercises, all with solutions, making the book highly suitable for individual study.




Quantum Information Science and Its Contributions to Mathematics


Book Description

This volume is based on lectures delivered at the 2009 AMS Short Course on Quantum Computation and Quantum Information, held January 3-4, 2009, in Washington, D.C. Part I of this volume consists of two papers giving introductory surveys of many of the important topics in the newly emerging field of quantum computation and quantum information, i.e., quantum information science (QIS). The first paper discusses many of the fundamental concepts in QIS and ends with the curious and counter-intuitive phenomenon of entanglement concentration. The second gives an introductory survey of quantum error correction and fault tolerance, QIS's first line of defense against quantum decoherence. Part II consists of four papers illustrating how QIS research is currently contributing to the development of new research directions in mathematics. The first paper illustrates how differential geometry can be a fundamental research tool for the development of compilers for quantum computers. The second paper gives a survey of many of the connections between quantum topology and quantum computation. The last two papers give an overview of the new and emerging field of quantum knot theory, an interdisciplinary research field connecting quantum computation and knot theory. These two papers illustrate surprising connections with a number of other fields of mathematics. In the appendix, an introductory survey article is also provided for those readers unfamiliar with quantum mechanics.




Polytopes - Combinations and Computation


Book Description

Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs.