Skip to main content
Free carbon-neutral shipping over $39.99  ·  Thousands of books on sale — sale ends soon

Completely Regular Codes in Distance Regular Graphs

by Minjia Shi

CRC Press

Hardback or Cased Book 00512 pages Mar 14, 2025

(No reviews yet) Write a Review
Millions of titlesEvery book you're looking for
Carbon-neutral shippingFree on orders over $39.99
Fast shipping worldwideDelivered to your door
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 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
Author:
Minjia Shi
Publisher:
CRC Press
Publication Date:
Mar 14, 2025
Number of pages:
00512 pages
Binding:
Hardback or Cased Book
ISBN-10:
1032494441
ISBN-13:
9781032494449