Classification Algorithms for Codes and Designs / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$135.20
Used and New from Other Sellers
Used and New from Other Sellers
from $69.67
Usually ships in 1-2 business days
(Save 58%)
Other sellers (Hardcover)
  • All (12) from $69.67   
  • New (7) from $69.67   
  • Used (5) from $0.00   

Overview

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms that this topic has flourished and matured. This book is the first comprehensive reference on combinatorial classification algorithms, with emphasis on both the general theory and application to central families of combinatorial objects, in particular, codes and designs.

The book will be of great interest to researchers and can be used as course material for graduate courses in both computer science and mathematics.

Read More Show Less

Editorial Reviews

From the Publisher
From the reviews:

"The authors of this book have been responsible for some quite remarkable combinatorial enumeration results … . They are therefore well-qualified to provide this comprehensive survey of state-of-the-art algorithms for the classification of codes and designs. … Overall the book is a timely and authoritative work, and an extremely valuable reference for any researcher working in the field of combinatorial classification." (Peter B.Gibbons, Zentralblatt MATH, Vol. 1089 (15), 2006)

"For any researcher involved with combinatorial algorithms, this book is a must-have. It is absolutely essential for anyone doing enumeration algorithms on t-designs or codes. … This is one of the few useful books on combinatorial design algorithms. … Finally, the book contains (open) research problems sprinkled throughout, which should be useful for researchers … . It would make a good textbook for a senior undergraduate or a graduate course on computing in design and coding theory." (G. H. J. Van Rees and Pak Ching Li, Mathematical Reviews, Issue 2008 a)

Read More Show Less

Product Details

  • ISBN-13: 9783540289906
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/22/2005
  • Series: Algorithms and Computation in Mathematics Series , #15
  • Edition description: 2006
  • Edition number: 1
  • Pages: 412
  • Product dimensions: 0.94 (w) x 9.21 (h) x 6.14 (d)

Table of Contents

1 Introduction.- 2 Graphs, Designs, and Codes.- 3 Representations and Isomorphism.- 4 Isomorph-Free Exhaustive Generation.- 5 Auxiliary Algorithms.- 6 Classification of Designs.- 7 Classification of Codes.- 8 Classification of Related Structures.- 9 Prescribing Automorphism Groups.- 10 Validity of Computational Results.- 11 Computational Complexity.- 12 Nonexistence of Projective Planes of Order 10.- References.- Problem Index.- Index

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)