Home > Mathematics and Science Textbooks > Mathematics > Combinatorics and graph theory > Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)
33%
Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)

Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

This volume presents papers related to the DIMACS workshop, ""Codes and Association Schemes"". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest.

Table of Contents:
Harmonic weight enumerators of nonbinary codes and MacWilliams identities by C. Bachoc Numerical results on the asymptotic rate of binary codes by A. Barg and D. B. Jaffe Weakly biased arrays, almost independent arrays and error-correcting codes by J. Bierbrauer and H. Schellwat Indexes of spherical codes by P. Boyvalenkov, D. Danev, and P. Kazakov Codes over $\mathbb Z_{p^n}$ and association schemes by P. Camion Bent, resilient functions and the numerical normal form by C. Carlet and P. Guillot On identifying codes by G. D. Cohen, I. Honkala, A. Lobstein, and G. Zemor Ternary Hamming and binary perfect covering codes by I. J. Dejter and K. T. Phelps A Riemann hypothesis analogue for self-dual codes by I. Duursma On perfect codes in the Johnson scheme by T. Etzion On perfect constant weight codes by T. Etzion and J. van Lint On additive $GF(4)$ codes by P. Gaborit, W. C. Huffman, J.-L. Kim, and V. Pless Integral zeroes of Krawtchouk polynomials by L. Habsieger Some algebra related to $P$- and $Q$-polynomial association schemes by T. Ito, K. Tanabe, and P. Terwilliger Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials by I. Krasikov Survey of binary Krawtchouk polynomials by I. Krasikov and S. Litsyn On an algebraic method for bounding the covering radius by T. Laihonen Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets by W. J. Martin The isomorphism problem for circulant graphs via Schur ring theory by M. Muzychuk, M. Klin, and R. Poschel New 1-generator quasi-twisted codes over GF(5) by I. Siap, N. Aydin, and D. Ray-Chaudhuri Communication complexity and orthogonal polynomials by U. Tamm Estimates of the distance distribution of nonbinary codes, with applications by A. Ashikhmin, A. Barg, and S. Litsyn.


Best Sellers


Product Details
  • ISBN-13: 9780821820742
  • Publisher: American Mathematical Society
  • Publisher Imprint: American Mathematical Society
  • Height: 267 mm
  • No of Pages: 320
  • Series Title: Series in Discrete Mathematics & Theoretical Computer Science
  • Sub Title: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center
  • Width: 184 mm
  • ISBN-10: 0821820745
  • Publisher Date: 01 Jan 2001
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Spine Width: 22 mm
  • Weight: 794 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)
American Mathematical Society -
Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Codes and Association Schemes: DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center(Series in Discrete Mathematics & Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA