株式会社極東書店トップ ＞ 商品一覧 ＞ Completely Regular Codes in Distance Regular Graphs.
商品詳細
Completely Regular Codes in Distance Regular Graphs.
・ISBN 978-1-032-49444-9 hard GB£ 187.99
￥59,555.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-003-39393-1
| 著者・編者 | Shi, Minjia / Sole, Patrick (eds.), |
|---|---|
| シリーズ | Chapman & Hall/CRC Monographs and Research Notes in Mathematics |
| 出版社 | (Chapman & Hall/CRC, UK) |
| 出版年月 | 2025 |
| ページ数 | 512 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-13489＞ |
解説
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
- Written by pioneering experts in the domain
- Suitable as a research reference at the master's level
- Includes extensive tables of completely regular codes in the Hamming graph
- Features a collection of up-to-date surveys