Completely Regular Codes in Distance Regular Graphs by Minjia... - 9781032494449

Completely Regular Codes in Distance Regular GraphsAuthor(s): Minjia Shi, Patrick Sol\nFormat: Hardback\nPublisher: Taylor & Francis Ltd, United Kingdom\nImprint: Chapman & Hall/CRC\nISBN-13: 9781032494449, 978-1032494449\nSynopsis\nThe 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.\n\nCompletely 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 severs