Minjia S. Completely Regular Codes in Distance Regular Graphs 2025 torrent

Textbook in PDF format

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.
Features
Written 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
List of Contributors
Introduction
Completely Regular Codes and Equitable Partitions
Completely Regular Codes Over Finite Fields
Completely Regular Codes in the Johnson Graphs
Codes Over Rings and Modules
Group Actions on Codes in Graphs
Some Completely Regular Codes in Doob Graphs
Completely Regular Codes: Tables of Small Parameters for Binary and Ternary Hamming Graphs
Index