Completely Regular Codes in Distance Regular Graphs

Minjia Shi

ISBN 10: 1032494441 ISBN 13: 9781032494449
Edité par CRC Press, 2025
Ancien(s) ou d'occasion HRD

Vendeur PBShop.store UK, Fairford, GLOS, Royaume-Uni Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Honoris Librarius
Membre AbeBooks depuis 1996


A propos de cet article

Description :

Used Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur P2-9781032494449

Signaler cet article

Synopsis :

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.

À propos de l?auteur:

Minjia Shi earned his Ph.D. from the Institute of Computer Network Systems, Hefei University of Technology, China, in 2010. From August 2012 to August 2013, he was a visiting researcher with the School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore. From July 2016 to August 2016, he was a visiting researcher with Telecom Paris Tech, Paris, France. Later, he visited the Sobolev Institute of Mathematics in 2020. He has been a Professor at the School of Mathematical Sciences, Anhui University, since 2017. He is the author of more than 100 journal articles and two books. His current research interests include algebraic coding theory and cryptography.

Patrick Solé received the Ingénieur and Docteur-Ingénieur degrees both from École Nationale Supérieure des Télécommunications, Paris, France, in 1984 and 1987, respectively, and the habilitation à diriger des recherches from Université de Nice-Sophia Antipolis, Sophia Antipolis, France, in 1993.

He has held visiting positions at Syracuse University, Syracuse, NY, from 1987 to 1989, Macquarie University, Sydney, Australia, from 1994 to 1996, and Lille University, Lille, France, from 1999 to 2000.

Since 1989, he has been a permanent member of the CNRS and became Directeur de Recherche in 1996. He is currently a member of the CNRS lab I2M, Marseilles, France.

His research interests include coding theory (codes over rings, quasi-cyclic codes), interconnection networks (graph spectra, expanders), vector quantization (lattices), and cryptography (boolean functions, secret sharing schemes). He is the author of over 300 journal articles and 3 books.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Détails bibliographiques

Titre : Completely Regular Codes in Distance Regular...
Éditeur : CRC Press
Date d'édition : 2025
Reliure : HRD
Etat : Used - Good

Meilleurs résultats de recherche sur AbeBooks

Image d'archives

Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Ancien ou d'occasion Couverture rigide

Vendeur : Books From California, Simi Valley, CA, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

hardcover. Etat : Fine. N° de réf. du vendeur mon0003826055

Contacter le vendeur

Acheter D'occasion

EUR 129,56
Expédition à EUR 4,25
Expédition nationale : Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Shi, Minjia (EDT); Solé, Patrick (EDT)
Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 48309998-n

Contacter le vendeur

Acheter neuf

EUR 180,88
Expédition à EUR 2,25
Expédition nationale : Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Shi, Minjia (EDT); Solé, Patrick (EDT)
Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 48309998-n

Contacter le vendeur

Acheter neuf

EUR 182,32
Expédition à EUR 17,30
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Minjia Shi
Edité par Taylor & Francis Ltd, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide
impression à la demande

Vendeur : CitiRetail, Stevenage, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Hardcover. Etat : 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. N° de réf. du vendeur 9781032494449

Contacter le vendeur

Acheter neuf

EUR 182,34
Expédition à EUR 42,67
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Minjia Shi
Edité par Taylor & Francis Ltd, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide
impression à la demande

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Hardcover. Etat : 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 multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781032494449

Contacter le vendeur

Acheter neuf

EUR 183,19
Livraison gratuite
Expédition nationale : Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Minjia Shi
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Buch. Etat : 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. N° de réf. du vendeur 9781032494449

Contacter le vendeur

Acheter neuf

EUR 204,80
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Shi, Minjia (EDT); Solé, Patrick (EDT)
Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Ancien ou d'occasion Couverture rigide

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 48309998

Contacter le vendeur

Acheter D'occasion

EUR 214,12
Expédition à EUR 2,25
Expédition nationale : Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Shi, Minjia (EDT); Solé, Patrick (EDT)
Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Ancien ou d'occasion Couverture rigide

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 48309998

Contacter le vendeur

Acheter D'occasion

EUR 214,38
Expédition à EUR 17,30
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Edité par Chapman and Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide

Vendeur : Majestic Books, Hounslow, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 410728059

Contacter le vendeur

Acheter neuf

EUR 224,35
Expédition à EUR 7,50
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : 3 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Minjia Shi
Edité par Chapman And Hall/CRC, 2025
ISBN 10 : 1032494441 ISBN 13 : 9781032494449
Neuf Couverture rigide
impression à la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Buch. Etat : 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. N° de réf. du vendeur 9781032494449

Contacter le vendeur

Acheter neuf

EUR 226,50
Expédition à EUR 65,83
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

There are 6 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre