Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Books From California, Simi Valley, CA, U.S.A.
hardcover. Condition: Fine.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Best Price, Torrance, CA, U.S.A.
Condition: New. SUPER FAST SHIPPING.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Majestic Books, Hounslow, United Kingdom
£ 183.80
Convert currencyQuantity: 3 available
Add to basketCondition: New.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
£ 185.83
Convert currencyQuantity: 1 available
Add to basketHRD. Condition: Used - Good. Used Book. Shipped from UK. Established seller since 2000.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 187.14
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Taylor & Francis Ltd, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Hardcover. Condition: 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 197.08
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: Biblios, Frankfurt am main, HESSE, Germany
£ 213.41
Convert currencyQuantity: 3 available
Add to basketCondition: New.
Published by Taylor & Francis Ltd, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: AussieBookSeller, Truganina, VIC, Australia
£ 200.53
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Published by Chapman and Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 207.95
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Published by Taylor & Francis Ltd, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: CitiRetail, Stevenage, United Kingdom
£ 206.49
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Seller: Revaluation Books, Exeter, United Kingdom
£ 257.95
Convert currencyQuantity: 2 available
Add to basketHardcover. Condition: Brand New. 504 pages. 10.00x7.00x10.00 inches. In Stock.
Published by Chapman And Hall/CRC, 2025
ISBN 10: 1032494441 ISBN 13: 9781032494449
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 268.16
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.