Completely Regular Codes in Distance Regular Graphs (1) (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)

By: Minjia Shi and Patrick Solé

Sign Up Now! Already a Member? Log In
You must be logged into Bookshare to access this title. Learn about membership options, or view our freely available titles.

Synopsis: 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.

Book Quality:: Publisher Quality
Book Size:: 520 Pages
ISBN-13:: 9781040309063
Related ISBNs:: 9781040309025, 9781003393931, 9781032494449
Publisher:: CRC Press
Date of Addition:: 03/14/25
Copyrighted By:: selection and editorial matter, Minjia Shi and Patrick Solé
Adult content:: No
Language:: English
Has Image Descriptions:: No
Categories:: Nonfiction, Computers and Internet, Mathematics and Statistics
Submitted By:: Bookshare Staff
Usage Restrictions:: This is a copyrighted book.
Edited by:: Minjia Shi
Edited by:: Patrick Solé