Completely Regular Codes in Distance Regular Graphs

[bookbestseller]

Completely Regular Codes in Distance Regular Graphs
English | 2025 | ISBN: 1032494441 | 512 Pages | PDF EPUB (True) | 15 MB
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.

RapidGator
https://rg.to/file/824048bbdc696f1bd29c3a41538c5c51/03mnn.7z.html
TakeFile
https://takefile.link/f60muhyjcwlv/03mnn.7z.html
Fileaxa
https://fileaxa.com/bw2wxs8b9u00/03mnn.7z
Fikper
https://fikper.com/v7kTgaK7XB/03mnn.7z.html