Codes and Rings: Theory and Practice is a systematic review of literature that focuses on codes over rings and rings acting on codes. Since the breakthrough works on quaternary codes in the 1990s, two decades of research have moved the field far beyond its original periphery. This book fills this gap by consolidating results scattered in the literature, addressing classical as well as applied aspects of rings and coding theory. New research covered by the book encompasses skew cyclic codes, decomposition theory of quasi-cyclic codes and related codes and duality over Frobenius rings. Primarily suitable for ring theorists at PhD level engaged in application research and coding theorists interested in algebraic foundations, the work is also valuable to computational scientists and working cryptologists in the area. Consolidates 20+ years of research in one volume, helping researchers save time in the evaluation of disparate literature Discusses duality formulas in the context of Frobenius rings Reviews decomposition of quasi-cyclic codes under ring action Evaluates the ideal and modular structure of skew-cyclic codes Supports applications in data compression, distributed storage, network coding, cryptography and across error-correction
This is the proceedings volume of the International Centre for Pure and Applied Mathematics Summer School course held in Ankara, Turkey, in August 2008.
This book provides a self-contained introduction to algebraic coding theory over finite Frobenius rings.
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 ...
This book will be of interest to both professional and academic researchers in the fields of communication and coding theory.
Dedicated to the memory of the Soviet mathematician S D Berman (1922-1987), this work covers topics including Berman's achievements in coding theory, including his pioneering work on abelian codes and his results on the theory of threshold ...
This is the proceedings volume of the International Centre for Pure and Applied Mathematics Summer School course held in Ankara, Turkey, in August 2008.
This bound has the following generalization. Theorem 7.3. [57] Let C be a linear code over a principal ideal ring with minimum Hamming weight d then d ≤ n − rank(C)+1. We call codes meeting this bound MDR (Maximum Distance with ...
The text then takes a look at coding and combinatorics and the structure of semisimple rings.
Distributed joint source-channel coding on a multiple access channel / Vinod Sharma and R. Rajesh -- pt. 4. Other selected topics in information and coding theory. ch. 11.
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.