English | 2025 | ISBN: 9781003393931 | 521 pages | PDF | 14.66 MB
Most of Delsarte examples were in the Hamming and Johnson graphs.
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 domain
Suitable as a research reference at the master’s level
Includes extensive tables of completely regular codes in the Hamming graph
Features a collection of up-to-date surveys.
