Commutative Algebra Methods For Coding Theory

This book aims to be a comprehensive treatise on the interactions between Coding Theory and Commutative Algebra. With the help of a multitude of examples, it expands and systematizes the known and versatile commutative algebraic framework used, since the early 90’s, to study linear codes. The book provides the necessary background for the reader to advance with similar research on coding theory topics from commutative algebraic perspectives.

This book aims to be a comprehensive treatise on the interactions between Coding Theory and Commutative Algebra. With the help of a multitude of examples, it expands and systematizes the known and versatile commutative algebraic framework used, since the early 90's, to study linear codes. The book provides the necessary background for the reader to advance with similar research on coding theory topics from commutative algebraic perspectives.

This book aims to be a comprehensive treatise on the interactions between Coding Theory and Commutative Algebra. With the help of a multitude of examples, it expands and systematizes the known and versatile commutative algebraic framework used, since the early 90’s, to study linear codes. The book provides the necessary background for the reader to advance with similar research on coding theory topics from commutative algebraic perspectives.

Coding theory and cryptography allow secure and reliable data transmission, which is at the heart of modern communication. Nowadays, it is hard to find an electronic device without some code inside. Gröbner bases have emerged as the main tool in computational algebra, permitting numerous applications, both in theoretical contexts and in practical situations. This book is the first book ever giving a comprehensive overview on the application of commutative algebra to coding theory and cryptography. For example, all important properties of algebraic/geometric coding systems (including encoding, construction, decoding, list decoding) are individually analysed, reporting all significant approaches appeared in the literature. Also, stream ciphers, PK cryptography, symmetric cryptography and Polly Cracker systems deserve each a separate chapter, where all the relevant literature is reported and compared. While many short notes hint at new exciting directions, the reader will find that all chapters fit nicely within a unified notation.

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research

This book provides a self-contained introduction to algebraic coding theory over finite Frobenius rings. It is the first to offer a comprehensive account on the subject. Coding theory has its origins in the engineering problem of effective electronic communication where the alphabet is generally the binary field. Since its inception, it has grown as a branch of mathematics, and has since been expanded to consider any finite field, and later also Frobenius rings, as its alphabet. This book presents a broad view of the subject as a branch of pure mathematics and relates major results to other fields, including combinatorics, number theory and ring theory. Suitable for graduate students, the book will be of interest to anyone working in the field of coding theory, as well as algebraists and number theorists looking to apply coding theory to their own work.

These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 16-21, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the Gilbert-Varshamov bound. The result was considered sensational. Furthermore, it was surprising to see these unrelated areas of mathematics collaborating. The aim of this course is to give an introduction to coding theory and to sketch the ideas of algebraic geometry that led to the new result. Finally, a number of applications of these methods of algebraic geometry to coding theory are given. Since this is a new area, there are presently no references where one can find a more extensive treatment of all the material. However, both for algebraic geometry and for coding theory excellent textbooks are available. The combination ofthe two subjects can only be found in a number ofsurvey papers. A book by C. Moreno with a complete treatment of this area is in preparation. We hope that these notes will stimulate further research and collaboration of algebraic geometers and coding theorists. G. van der Geer, J.H. van Lint Introduction to CodingTheory and Algebraic Geometry PartI -- CodingTheory Jacobus H. vanLint 11 1. Finite fields In this chapter we collect (without proof) the facts from the theory of finite fields that we shall need in this course

In this age of technology where messages are transmitted in sequences of 0's and 1's through space, errors can occur due to noisy channels. Thus, self-correcting code is vital to eradicate these errors when the number of errors is small. It is widely used in industry for a variety of applications including e-mail, telephone, and remote sensing (for example, photographs of Mars).An expert in algebra and algebraic geometry, Tzuong-Tsieng Moh covers many essential aspects of algebraic coding theory in this book, such as elementary algebraic coding theories, the mathematical theory of vector spaces and linear algebras behind them, various rings and associated coding theories, a fast decoding method, useful parts of algebraic geometry and geometric coding theories.This book is accessible to advanced undergraduate students, graduate students, coding theorists and algebraic geometers.