This book grew out of our lectures given in the Oberseminar on 'Cod ing Theory and Number Theory' at the Mathematics Institute of the Wiirzburg University in the Summer Semester, 2001. The coding the ory combines mathematical elegance and some engineering problems to an unusual degree. The major advantage of studying coding theory is the beauty of this particular combination of mathematics and engineering. In this book we wish to introduce some practical problems to the math ematician and to address these as an essential part of the development of modern number theory. The book consists of five chapters and an appendix. Chapter 1 may mostly be dropped from an introductory course of linear codes. In Chap ter 2 we discuss some relations between the number of solutions of a diagonal equation over finite fields and the weight distribution of cyclic codes. Chapter 3 begins by reviewing some basic facts from elliptic curves over finite fields and modular forms, and shows that the weight distribution of the Melas codes is represented by means of the trace of the Hecke operators acting on the space of cusp forms. Chapter 4 is a systematic study of the algebraic-geometric codes. For a long time, the study of algebraic curves over finite fields was the province of pure mathematicians. In the period 1977 - 1982, V. D. Goppa discovered an amazing connection between the theory of algebraic curves over fi nite fields and the theory of q-ary codes.

This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas. Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars’ GPS systems, in online banking, etc. Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters 2-5 and offer a glimpse of advanced results that are presented without proofs and require more advanced mathematical skills. In the last chapter they review several further applications of number theory, ranging from check-digit systems to quantum computation and the organization of raster-graphics memory. Upper-level undergraduates, graduates and researchers in the field of number theory will find this book to be a valuable resource.

The inaugural research program of the Institute for Mathematical Sciences at the National University of Singapore took place from July to December 2001 and was devoted to coding theory and cryptology. As part of the program, tutorials for graduate students and junior researchers were given by world-renowned scholars. These tutorials covered fundamental aspects of coding theory and cryptology and were designed to prepare for original research in these areas. The present volume collects the expanded lecture notes of these tutorials. The topics range from mathematical areas such as computational number theory, exponential sums and algebraic function fields through coding-theory subjects such as extremal problems, quantum error-correcting codes and algebraic-geometry codes to cryptologic subjects such as stream ciphers, public-key infrastructures, key management, authentication schemes and distributed system security.

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.

The Mathematical Theory of Coding focuses on the application of algebraic and combinatoric methods to the coding theory, including linear transformations, vector spaces, and combinatorics. The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on self-dual and quasicyclic codes, quadratic residues and codes, balanced incomplete block designs and codes, bounds on code dictionaries, code invariance under permutation groups, and linear transformations of vector spaces over finite fields. The text then takes a look at coding and combinatorics and the structure of semisimple rings. Topics include structure of cyclic codes and semisimple rings, group algebra and group characters, rings, ideals, and the minimum condition, chains and chain groups, dual chain groups, and matroids, graphs, and coding. The book ponders on group representations and group codes for the Gaussian channel, including distance properties of group codes, initial vector problem, modules, group algebras, andrepresentations, orthogonality relationships and properties of group characters, and representation of groups. The manuscript is a valuable source of data for mathematicians and researchers interested in the mathematical theory of coding.

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.

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.