• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Completely Regular Codes in Distance Regular Graphs

Completely Regular Codes in Distance Regular Graphs

Hardcover

Series: Chapman & Hall/CRC Monographs and Research Notes in Mathemat

General MathematicsGeometry

ISBN10: 1032494441
ISBN13: 9781032494449
Publisher: CRC Press
Published: Mar 14 2025
Pages: 512
Weight: 2.46
Height: 1.13 Width: 7.00 Depth: 10.00
Language: English

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.

Also in

General Mathematics