Minjia Shi – författare

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

The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the master’s levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys