Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 124,53
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Fine.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 197,03
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 234,16
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 238,91
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 249,90
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 233,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 247,40
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 256,94
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 249,43
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 254,00
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 272,26
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 333,96
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 504 pages. 10.00x7.00x10.00 inches. In Stock.
Idioma: Inglés
Publicado por Chapman And Hall/CRC Mär 2025, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 204,80
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the master's levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys 522 pp. Englisch.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 197,04
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. 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.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the masters levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 226,50
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the master's levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys.