1st Edition

Completely Regular Codes in Distance Regular Graphs

Edited By Minjia Shi, Patrick Solé Copyright 2025
520 Pages 11 B/W Illustrations
by Chapman & Hall

520 Pages 11 B/W Illustrations
by Chapman & Hall

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... Read more

Introduction

Chapter 1: Completely regular codes and equitable partitions
Denis S. Krotov, Vladimir N. Potapov

Chapter 2: Completely regular codes over finite fields
Victor A. Zinoviev

Chapter 3: Completely regular codes in the Johnson graph
Alexander Gavrilyuk, Victor A. Zinoviev

Chapter 4: Codes over rings and modules
Minjia Shi

Chapter 5: Group actions on codes in graphs
Daniel R. Hawtin and Cheryl E. Praeger

Chapter 6: Some completely regular codes in Doob graphs
Evgeny A. Bespalov, Denis S. Krotov

Chapter 7: Completely regular codes: tables of small parameters for binary and ternary Hamming graphs
Jack H. Koolen, Denis S. Krotov, William J. Martin

Biography

Minjia Shi earned his Ph.D. from the Institute of Computer Network Systems, Hefei University of Technology, China, in 2010. From August 2012 to August 2013, he was a visiting researcher with the School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore. From July 2016 to August 2016, he was a visiting researcher with Telecom Paris Tech, Paris, France. Later, he visited the Sobolev Institute of Mathematics in 2020. He has been a Professor at the School of Mathematical Sciences, Anhui University, since 2017. He is the author of more than 100 journal articles and two books. His current research interests include algebraic coding theory and cryptography.

Patrick Solé received the Ingénieur and Docteur-Ingénieur degrees both from École Nationale Supérieure des Télécommunications, Paris, France, in 1984 and 1987, respectively, and the habilitation à diriger des recherches from Université de Nice-Sophia Antipolis, Sophia Antipolis, France, in 1993.

He has held visiting positions at Syracuse University, Syracuse, NY, from 1987 to 1989, Macquarie University, Sydney, Australia, from 1994 to 1996, and Lille University, Lille, France, from 1999 to 2000.

Since 1989, he has been a permanent member of the CNRS and became Directeur de Recherche in 1996. He is currently a member of the CNRS lab I2M, Marseilles, France.

His research interests include coding theory (codes over rings, quasi-cyclic codes), interconnection networks (graph spectra, expanders), vector quantization (lattices), and cryptography (boolean functions, secret sharing schemes). He is the author of over 300 journal articles and 3 books.