Completely Regular Codes in Distance Regular Graphs

By: Minjia Shi (Editor), Patrick Solé (Editor)

Write A Review

Hardcover | 13 March 2025 | Edition Number 1

At a Glance

Hardcover
522 Pages

Dimensions(cm)
25.4 x 17.8 x 2.87

Hardcover

RRP $368.00

$315.99

14%OFF

or 4 interest-free payments of $79.00 with

Ships in 3 to 5 business days

The concept of completely regular code 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 graph. 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 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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $49.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.