Completely Regular Codes in Distance Regular Graphs - Shi, Minjia; Solé, Patrick; (szerk.) - Prospero Internetes Könyváruház
Kosár (0)
Kívánságlista (0)
Értesítés a kedvenc témákról
__

Completely Regular Codes in Distance Regular Graphs

 
Kiadás sorszáma: 1
Kiadó: Chapman and Hall
Megjelenés dátuma:
 
Normál ár:
Kiadói listaár:
GBP 155.00
Becsült forint ár:
81 375 Ft (77 500 Ft + 5% áfa)
Miért becsült?
 
Az Ön ára:
73 238 (69 750 Ft + 5% áfa )
Kedvezmény(ek): 10% (kb. 8 138 Ft)
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
Kattintson ide a feliratkozáshoz
 
Beszerezhetőség:
Még nem jelent meg, de rendelhető. A megjelenéstől számított néhány héten belül megérkezik.
 
Kosárba teszek
  példányt

 
Rövid leírás:

This book 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.

Hosszú leírás:

The concept of completely regular code 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 graph. 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 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.

Tartalomjegyzék:

1. Completely regular codes and equitable partitions. 2. Completely regular codes over finite fields. 3. Completely regular codes in the Johnson graph. 4. Codes over rings and modules. 5. Group actions on codes in graphs. 6. Some completely regular codes in Doob graphs. 7. Completely regular codes: tables of small parameters for binary and ternary Hamming graphs.