Algebraic and Stochastic Coding Theory

This book covers advanced topics in Discrete Mathematics and its applications to day-to-day problems in several areas. It is intended for graduate students of Computer Science, Mathematics and Enginee

This book aims to serve as an introductory text on algebraic coding theory. The contents are suitable for a final year undergraduate and beginning graduate course in Electrical Engineering. The materi

Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean

This textbook equips graduate students and advanced undergraduates with the necessary theoretical tools for applying algebraic geometry to information theory, and it covers primary applications in cod

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 alg

Covering topics in algebraic geometry, coding theory, and cryptography, this volume presents interdisciplinary group research completed for the February 2016 conference at the Institute for Pure and A

The primary purpose of this monograph is to explore the ties between digital signal processing and error-control codes, with the thought of eventually making them two components of a unified theory, o

Sure to be influential, this book lays the foundations for the use of algebraic geometry in statistical learning theory. Many widely used statistical models and learning machines applied to information science have a parameter space that is singular: mixture models, neural networks, HMMs, Bayesian networks, and stochastic context-free grammars are major examples. Algebraic geometry and singularity theory provide the necessary tools for studying such non-smooth models. Four main formulas are established: 1. the log likelihood function can be given a common standard form using resolution of singularities, even applied to more complex models; 2. the asymptotic behaviour of the marginal likelihood or 'the evidence' is derived based on zeta function theory; 3. new methods are derived to estimate the generalization errors in Bayes and Gibbs estimations from training errors; 4. the generalization errors of maximum likelihood and a posteriori methods are clarified by empirical process theory o

This fundamental monograph introduces both the probabilistic and algebraic aspects of information theory and coding. It has evolved from the authors' years of experience teaching at the undergraduate level, including several Cambridge Maths Tripos courses. The book provides relevant background material, a wide range of worked examples and clear solutions to problems from real exam papers. It is a valuable teaching aid for undergraduate and graduate students, or for researchers and engineers who want to grasp the basic principles.

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 cryptogra

The theory of algebraic function fields over finite fields has its origins in number theory. However, after Goppa`s discovery of algebraic geometry codes around 1980, many applications of function fi

Stochastic games have an element of chance: the state of the next round is determined probabilistically depending upon players' actions and the current state. Successful players need to balance the need for short-term payoffs while ensuring future opportunities remain high. The various techniques needed to analyze these often highly non-trivial games are a showcase of attractive mathematics, including methods from probability, differential equations, algebra, and combinatorics. This book presents a course on the theory of stochastic games going from the basics through to topics of modern research, focusing on conceptual clarity over complete generality. Each of its chapters introduces a new mathematical tool – including contracting mappings, semi-algebraic sets, infinite orbits, and Ramsey's theorem, among others – before discussing the game-theoretic results they can be used to obtain. The author assumes no more than a basic undergraduate curriculum and illustrates the theory with num

This unique text for beginning graduate students gives a self-contained introduction to the mathematical properties of stochastics and presents their applications to Markov processes, coding theory, p

This book links two subjects: algebraic geometry and coding theory. It uses a novel approach based on the theory of algebraic function fields. Coverage includes the Riemann-Rock theorem, zeta function

Created as a celebration of mathematical pioneer Emma Previato, this comprehensive book highlights the connections between algebraic geometry and integrable systems, differential equations, mathematical physics, and many other areas. The authors, many of whom have been at the forefront of research into these topics for the last decades, have all been influenced by Previato's research, as her collaborators, students, or colleagues. The diverse articles in the book demonstrate the wide scope of Previato's work and the inclusion of several survey and introductory articles makes the text accessible to graduate students and non-experts, as well as researchers. The articles in this second volume discuss areas related to algebraic geometry, emphasizing the connections of this central subject to integrable systems, arithmetic geometry, Riemann surfaces, coding theory and lattice theory.

Discover a fresh approach for designing more efficient and cooperative wireless communications networks with this systematic guide. Covering everything from fundamental theory to current research topics, leading researchers describe a new, network-aware coding strategy that exploits the signal interactions that occur in dense wireless networks directly at the waveform level. Using an easy-to-follow, layered structure, this unique text begins with a gentle introduction for those new to the subject, before moving on to explain key information-theoretic principles and establish a consistent framework for wireless physical layer network coding (WPNC) strategies. It provides a detailed treatment of Network Coded Modulation, covers a range of WPNC techniques such as Noisy Network Coding, Compute and Forward, and Hierarchical Decode and Forward, and explains how WPNC can be applied to parametric fading channels, frequency selective channels, and complex stochastic networks. This is essential

The need to transmit and store massive amounts of data reliably and without error is a vital part of modern communications systems. Error-correcting codes play a fundamental role in minimising data corruption caused by defects such as noise, interference, crosstalk and packet loss. This book provides an accessible introduction to the basic elements of algebraic codes, and discusses their use in a variety of applications. The author describes a range of important coding techniques, including Reed-Solomon codes, BCH codes, trellis codes, and turbocodes. Throughout the book, mathematical theory is illustrated by reference to many practical examples. The book was first published in 2003 and is aimed at graduate students of electrical and computer engineering, and at practising engineers whose work involves communications or signal processing.

The past few years have witnessed significant developments in algebraic coding theory. This book provides an advanced treatment of the subject from an engineering perspective, covering the basic principles and their application in communications and signal processing. Emphasis is on codes defined on the line, on the plane, and on curves, with the core ideas presented using commutative algebra and computational algebraic geometry made accessible using the Fourier transform. Starting with codes defined on a line, a background framework is established upon which the later chapters concerning codes on planes, and on curves, are developed. The decoding algorithms are developed using the standard engineering approach applied to those of Reed-Solomon codes, enabling them to be evaluated against practical applications. Integrating recent developments in the field into the classical treatment of algebraic coding, this is an invaluable resource for graduate students and researchers in telecommun

The need to transmit and store massive amounts of data reliably and without error is a vital part of modern communications systems. Error-correcting codes play a fundamental role in minimising data corruption caused by defects such as noise, interference, crosstalk and packet loss. This book provides an accessible introduction to the basic elements of algebraic codes, and discusses their use in a variety of applications. The author describes a range of important coding techniques, including Reed-Solomon codes, BCH codes, trellis codes, and turbocodes. Throughout the book, mathematical theory is illustrated by reference to many practical examples. The book was first published in 2003 and is aimed at graduate students of electrical and computer engineering, and at practising engineers whose work involves communications or signal processing.

This book presents an algebraic development of the theory of countable state space Markov chains with discrete- and continuous-time parameters. A Markov chain is a stochastic process characterized by

Symmetric designs are an important class of combinatorial structures which arose first in the statistics and are now especially important in the study of finite geometries. This book presents some of the algebraic techniques that have been brought to bear on the question of existence, construction and symmetry of symmetric designs – including methods inspired by the algebraic theory of coding and by the representation theory of finite groups – and includes many results. Rich in examples and containing over 100 problems, the text also provides an introduction to many of the modern algebraic approaches used, through six lengthy appendices and supplementary problems. The book will be of interest to both combinatorialists and algebraists, and could be used as a course text for a graduate course.

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 ye

Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will refer to for years to come. The book covers the theory of strongly regular graphs, polar graphs, rank 3 graphs associated to buildings and Fischer groups, cyclotomic graphs, two-weight codes and graphs related to combinatorial configurations such as Latin squares, quasi-symmetric designs and spherical designs. It gives the complete classification of rank 3 graphs, including some new constructions. More than 100 graphs are treated individually. Some unified and streamlined proofs are featured, along with original material including a new approach to the (affine) half spin graphs of rank 5 hyperbolic polar spaces.

This monograph is a progressive introduction to non-commutativity in probability theory, summarizing and synthesizing recent results about classical and quantum stochastic processes on Lie algebras. In the early chapters, focus is placed on concrete examples of the links between algebraic relations and the moments of probability distributions. The subsequent chapters are more advanced and deal with Wigner densities for non-commutative couples of random variables, non-commutative stochastic processes with independent increments (quantum Lévy processes), and the quantum Malliavin calculus. This book will appeal to advanced undergraduate and graduate students interested in the relations between algebra, probability, and quantum theory. It also addresses a more advanced audience by covering other topics related to non-commutativity in stochastic calculus, Lévy processes, and the Malliavin calculus.

This book provides an in-depth introduction to real-world abstract algebraic problems. Chapters examine the prerequisite advanced mathematics needed, examine block designs, coding theory, and cryptogr

Riemann surfaces is a thriving area of mathematics with applications to hyperbolic geometry, complex analysis, fractal geometry, conformal dynamics, discrete groups, geometric group theory, algebraic curves and their moduli, various kinds of deformation theory, coding, thermodynamic formalism, and topology of three-dimensional manifolds. This collection of articles, authored by leading authorities in the field, comprises 16 expository essays presenting original research and expert surveys of important topics related to Riemann surfaces and their geometry. It complements the body of recorded research presented in the primary literature by broadening, re-working and extending it in a more focused and less formal framework, and provides a valuable commentary on contemporary work in the subject. An introductory section sets the scene and provides sufficient background to allow graduate students and research workers from other related areas access to the field.

Channel coding lies at the heart of digital communication and data storage, and this detailed introduction describes the core theory as well as decoding algorithms, implementation details, and performance analyses. In this book, Professors Ryan and Lin provide clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes. They also present detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, and product codes, providing a one-stop resource for both classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design. 250 varied and stimulating end-of-chapter problems are also included to test and enhance learning, making this an essential resource for students and practitioners a

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of algebraic combinatorics. Written by two of his former students, this book is based on notes from his influential graduate courses and on face-to-face discussions. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. A must-have fo

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of algebraic combinatorics. Written by two of his former students, this book is based on notes from his influential graduate courses and on face-to-face discussions. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. A must-have fo

The theory of Lévy processes in Lie groups is not merely an extension of the theory of Lévy processes in Euclidean spaces. Because of the unique structures possessed by non-commutative Lie groups, these processes exhibit certain interesting limiting properties which are not present for their counterparts in Euclidean spaces. These properties reveal a deep connection between the behaviour of the stochastic processes and the underlying algebraic and geometric structures of the Lie groups themselves. The purpose of this work is to provide an introduction to Lévy processes in general Lie groups, the limiting properties of Lévy processes in semi-simple Lie groups of non-compact type and the dynamical behavior of such processes as stochastic flows on certain homogeneous spaces. The reader is assumed to be familiar with Lie groups and stochastic analysis, but no prior knowledge of semi-simple Lie groups is required.

Ever since the seminal work of Goppa on algebraic-geometry codes, rational points on algebraic curves over finite fields have been an important research topic for algebraic geometers and coding theorists. The focus in this application of algebraic geometry to coding theory is on algebraic curves over finite fields with many rational points (relative to the genus). Recently, the authors discovered another important application of such curves, namely to the construction of low-discrepancy sequences. These sequences are needed for numerical methods in areas as diverse as computational physics and mathematical finance. This has given additional impetus to the theory of, and the search for, algebraic curves over finite fields with many rational points. This book aims to sum up the theoretical work on algebraic curves over finite fields with many rational points and to discuss the applications of such curves to algebraic coding theory and the construction of low-discrepancy sequences.

This is a comprehensive discussion of complexity as it arises in physical, chemical, and biological systems, as well as in mathematical models of nature. Common features of these apparently unrelated fields are emphasised and incorporated into a uniform mathematical description, with the support of a large number of detailed examples and illustrations. The quantitative study of complexity is a rapidly developing subject with special impact in the fields of physics, mathematics, information science, and biology. Because of the variety of the approaches, no comprehensive discussion has previously been attempted. This book will be of interest to graduate students and researchers in physics (nonlinear dynamics, fluid dynamics, solid-state, cellular automata, stochastic processes, statistical mechanics and thermodynamics), mathematics (dynamical systems, ergodic and probability theory), information and computer science (coding, information theory and algorithmic complexity), electrical engi

Finite fields are algebraic structures in which there is much research interest and they have been shown to have a wide range of applications. These proceedings give a state-of-the-art account of the area of finite fields and their applications in communications (coding theory, cryptology), combinatorics, design theory, quasirandom points, algorithms and their complexity. Typically, theory and application are tightly interwoven in the survey articles and original research papers included here. These also demonstrate inter-connections with other branches of pure mathematics such as number theory, group theory and algebraic geometry. This volume is an invaluable resource for any researcher in finite fields or related areas.

The theory of finite fields is a branch of modern algebra that has come to the fore in recent years because of its diverse applications in such areas as combinatorics, coding theory, cryptology and the mathematical study of switching circuits. The first part of this updated edition presents an introduction to this theory, emphasising those aspects that are relevant for application. The second part is devoted to a discussion of the most important applications of finite fields, especially to information theory, algebraic coding theory and cryptology. There is also a chapter on applications within mathematics, such as finite geometries, combinatorics and pseudo-random sequences. The book is meant to be used as a textbook: worked examples and copious exercises that range from the routine, to those giving alternative proofs of key theorems, to extensions of material covered in the text, are provided throughout. It will appeal to advanced undergraduates and graduate students taking courses o

Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of those applications together with a thorough general introduction to both design theory and coding theory - developing the relationship between the two areas. The first half of the book contains background material in design theory, including symmetric designs and designs from affine and projective geometry, and in coding theory, coverage of most of the important classes of linear codes. In particular, the authors provide a new treatment of the Reed-Muller and generalized Reed-Muller codes. The last three chapters treat the applications of coding theory to some important classes of designs, namely finite planes, Hadamard designs and Steiner systems, in particular the Witt systems. The book is aimed at mathematicians working in either coding theory or combinatorics - or related areas of algebra. The book is, however, designed to be used by non

Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of those applications together with a thorough general introduction to both design theory and coding theory - developing the relationship between the two areas. The first half of the book contains background material in design theory, including symmetric designs and designs from affine and projective geometry, and in coding theory, coverage of most of the important classes of linear codes. In particular, the authors provide a new treatment of the Reed-Muller and generalized Reed-Muller codes. The last three chapters treat the applications of coding theory to some important classes of designs, namely finite planes, Hadamard designs and Steiner systems, in particular the Witt systems. The book is aimed at mathematicians working in either coding theory or combinatorics - or related areas of algebra. The book is, however, designed to be used by non

This monograph develops an algebraic approach that can be used to construct convolutional codes that are efficient in both classical and nonclassical situations. Coding theory, which is an offshoot of