Completely regular codes in distance regular graphs /
"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, the...
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
Boca Raton :
CRC Press, Taylor & Francis Group,
2025.
|
| Edition: | First edition. |
| Series: | Monographs and research notes in mathematics.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | "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"-- |
|---|---|
| Item Description: | “A Chapman & Hall Book.” |
| Physical Description: | 1 online resource (viii, 512 pages). |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9781003393931 1003393934 9781040309025 104030902X 9781040309063 1040309062 |