All Books
Completely Regular Codes in Distance Regular Graphs (Chapman & Hall/Crc Monographs and Research Notes in Mathematics)
Mathematics

Completely Regular Codes in Distance Regular Graphs (Chapman & Hall/Crc Monographs and Research Notes in Mathematics)

5,447

Inclusive of all applicable taxes. FREE shipping on all orders.

Quantity:
1
Share:
Free DeliveryOn every order
15-Day ReturnEasy returns
Genuine BookPhysical copy only

Available Offers

  • 🚚Free DeliveryFree shipping on all orders
  • 💵Cash on DeliveryPay when your order arrives
  • ↩️15-Day Easy ReturnsHassle-free return policy
  • 🔒Cash on DeliveryPay safely when your order arrives

Check Delivery

Product Description

About This Book

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

About the Author

Completely Regular Codes in Distance Regular Graphs is authored by Minjia Shi | Patrick Solé.

Product description About the Author 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.

Book Highlights

Published by ‎ Chapman & Hall
Language: ‎ English
Publication date: ‎ 13 March 2025
Edition: ‎ 1st
Category: Mathematics > Algebra & Trigonometry
Dimensions: ‎ 17.78 x 2.87 x 25.4 cm
Weight: ‎ 454 g
FREE shipping on all BookShops.in orders
15-day hassle-free return policy
Cash on Delivery (COD) available across India

Book Specifications

ISBN-139781032494449
ISBN-101032494441
Publisher‎ Chapman & Hall
Language‎ English
Dimensions‎ 17.78 x 2.87 x 25.4 cm
Weight‎ 454 g
CategoryMathematics › Algebra & Trigonometry

Frequently Asked Questions

What is the price of Completely Regular Codes in Distance Regular Graphs?
Completely Regular Codes in Distance Regular Graphs is available at ₹5,447 on BookShops.in.
Does BookShops.in offer free delivery for Completely Regular Codes in Distance Regular Graphs?
FREE delivery on all orders for Completely Regular Codes in Distance Regular Graphs.
Is Cash on Delivery available for Completely Regular Codes in Distance Regular Graphs?
Yes, Cash on Delivery (COD) is available for Completely Regular Codes in Distance Regular Graphs on BookShops.in. Pay when your order arrives.
What is the return policy for Completely Regular Codes in Distance Regular Graphs?
BookShops.in offers a 15-day hassle-free return policy for Completely Regular Codes in Distance Regular Graphs. Contact us at [email protected] or call +91 81899 68108.
Is Completely Regular Codes in Distance Regular Graphs authentic?
Completely Regular Codes in Distance Regular Graphs is listed on BookShops.in after verification of product details including ISBN, title, and availability information.
Get In Touch

Contact BookShops.in

Find our bookstore in Madurai on the map below, or let us know about your reading experience by leaving a review.

Phone+91 81899 68108
Address12, Rajan Street, Main Road, KK Nagar, Madurai Tamilnadu 625020 India
Support HoursMon–Sat, 10:00 AM – 6:00 PM (IST)

Value your feedback

Enjoyed the books you ordered from us? Your review helps fellow readers discover our store and helps us improve.

Leave a Google Review

Your Cart

Your cart is empty

Add books to get started