
- 504 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Completely Regular Codes in Distance Regular Graphs
About this book
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
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half Title
- Series Page
- Title Page
- Copyright Page
- Table of Contents
- List of Contributors
- Introduction
- Chapter 1 ◾ Completely Regular Codes and Equitable Partitions
- Chapter 2 ◾ Completely Regular Codes over Finite Fields
- Chapter 3 ◾ Completely Regular Codes in the Johnson Graphs
- Chapter 4 ◾ Codes over Rings and Modules
- Chapter 5 ◾ Group Actions on Codes in Graphs
- Chapter 6 ◾ Some Completely Regular Codes in Doob Graphs
- Chapter 7 ◾ Completely Regular Codes: Tables of Small Parameters for
- Index