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
| ISBN: | 9781032494449 |
| Publication date: | 14th March 2025 |
| Author: | Minjia Shi, Patrick Sole |
| Publisher: | Chapman & Hall/CRC an imprint of CRC Press |
| Format: | Hardback |
| Pagination: | 516 pages |
| Series: | Chapman and Hall/CRC Monographs and Research Notes in Mathematics |
| Genres: |
Combinatorics and graph theory Mathematical logic Discrete mathematics Algebra Number theory Coding theory and cryptology Information technology: general topics Computer science |
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
Completely Regular Codes in Distance Regular Graphs features in the following genres: Combinatorics and graph theory, Mathematical logic, Discrete mathematics, Algebra, Number theory, Coding theory and cryptology, Information technology: general topics, Computer science
Completely Regular Codes in Distance Regular Graphs is available in Hardback
Completely Regular Codes in Distance Regular Graphs was written by Minjia Shi, Patrick Sole and published by Chapman & Hall/CRC an imprint of CRC Press
Completely Regular Codes in Distance Regular Graphs has 516 pages
Yes it is part of Chapman and Hall/CRC Monographs and Research Notes in Mathematics series
£169.19