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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
hardcover. Etat : Fine. N° de réf. du vendeur mon0003826055
Quantité disponible : 1 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : Used - Good. Used Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur P2-9781032494449
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. N° de réf. du vendeur 410728059
Quantité disponible : 3 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 48309998-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
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
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26403474852
Quantité disponible : 3 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781032494449_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 48309998-n
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L1-9781032494449
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
HRD. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L1-9781032494449
Quantité disponible : Plus de 20 disponibles