Name: Completely Regular Codes in Distance Regular Graphs (Chapman & Hall (en Inglés)
Price: 262830.00 CLP
Availability: InStock
Author: Shi Minjia,Solé Patrick
ISBN: 9781032494449

portada Completely Regular Codes in Distance Regular Graphs (Chapman & Hall (en Inglés)

Completely Regular Codes in Distance Regular Graphs (Chapman & Hall (en Inglés)

Formato

Libro Físico

Editorial

Crc Pr Inc

Autor

Shi Minjia,Solé Patrick

Idioma

Inglés

N° páginas

512

Encuadernación

Tapa Dura

ISBN13

9781032494449

N° edición

Completely Regular Codes in Distance Regular Graphs (Chapman & Hall (en Inglés)

Shi Minjia,Solé Patrick (Autor) · Crc Pr Inc · Tapa Dura

Libro Nuevo Importado

Envío: 20 a 24 días háb.

$ 525.650$ 262.830

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 262.830

Llega entre el 21 Ago y el 27 Ago a Santiago, Región Metropolitana. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Completely Regular Codes in Distance Regular Graphs (Chapman & Hall (en Inglés)"

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.