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.

Foreword by Dieter Jungnickel Finite Commutative Rings and their Applications answers a need for an introductory reference in finite commutative ring theory as applied to information and communication theory. This book will be of interest to both professional and academic researchers in the fields of communication and coding theory. The book is a concrete and self-contained introduction to finite commutative local rings, focusing in particular on Galois and Quasi-Galois rings. The reader is provided with an active and concrete approach to the study of the purely algebraic structure and properties of finite commutative rings (in particular, Galois rings) as well as to their applications to coding theory. Finite Commutative Rings and their Applications is the first to address both theoretical and practical aspects of finite ring theory. The authors provide a practical approach to finite rings through explanatory examples, thereby avoiding an abstract presentation of the subject. The section on Quasi-Galois rings presents new and unpublished results as well. The authors then introduce some applications of finite rings, in particular Galois rings, to coding theory, using a solid algebraic and geometric theoretical background.

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 coding theory and cryptography. Harald Niederreiter and Chaoping Xing provide the first detailed discussion of the interplay between nonsingular projective curves and algebraic function fields over finite fields. This interplay is fundamental to research in the field today, yet until now no other textbook has featured complete proofs of it. Niederreiter and Xing cover classical applications like algebraic-geometry codes and elliptic-curve cryptosystems as well as material not treated by other books, including function-field codes, digital nets, code-based public-key cryptosystems, and frameproof codes. Combining a systematic development of theory with a broad selection of real-world applications, this is the most comprehensive yet accessible introduction to the field available. Introduces graduate students and advanced undergraduates to the foundations of algebraic geometry for applications to information theory Provides the first detailed discussion of the interplay between projective curves and algebraic function fields over finite fields Includes applications to coding theory and cryptography Covers the latest advances in algebraic-geometry codes Features applications to cryptography not treated in other books

This volume contains the proceedings of the Virtual Conference on Noncommutative Rings and their Applications VII, in honor of Tariq Rizvi, held from July 5–7, 2021, and the Virtual Conference on Quadratic Forms, Rings and Codes, held on July 8, 2021, both of which were hosted by the Université d'Artois, Lens, France. The articles cover topics in commutative and noncommutative algebra and applications to coding theory. In some papers, applications of Frobenius rings, the skew group rings, and iterated Ore extensions to coding theory are discussed. Other papers discuss classical topics, such as Utumi rings, Baer rings, nil and nilpotent algebras, and Brauer groups. Still other articles are devoted to various aspects of the elementwise study for rings and modules. Lastly, this volume includes papers dealing with questions in homological algebra and lattice theory. The articles in this volume show the vivacity of the research of noncommutative rings and its influence on other subjects.

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 contains the proceedings of the Fifth International Conference on Noncommutative Rings and their Applications, held from June 12–15, 2017, at the University of Artois, Lens, France. The papers are related to noncommutative rings, covering topics such as: ring theory, with both the elementwise and more structural approaches developed; module theory with popular topics such as automorphism invariance, almost injectivity, ADS, and extending modules; and coding theory, both the theoretical aspects such as the extension theorem and the more applied ones such as Construction A or Reed–Muller codes. Classical topics like enveloping skewfields, weak Hopf algebras, and tropical algebras are also presented.

This article introduces the notion of duplex elements of the finite rings and corresponding neutrosophic rings. The authors establish duplex ring Dup(R) and neutrosophic duplex ring Dup(R)I)) by way of various illustrations. The tables of different duplicities are constructed to reveal the comparison between rings Dup(Zn), Dup(Dup(Zn)) and Dup(Dup(Dup(Zn ))) for the cyclic ring Zn . The proposed duplicity structures have several algebraic systems with dissimilar consequences. Author’s characterize finite rings with R + R is different from the duplex ring Dup(R). However, this characterization supports that R + R = Dup(R) for some well known rings, namely zero rings and finite fields.