Home > Computing and Information Technology > Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)
36%
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)

          
5
4
3
2
1

Available


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.
Quantity:
Add to Wishlist

About the Book

The 25 revised full papers presented here together with 7 invited papers address subjects such as block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.

Table of Contents:
On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities.- On Generalized Parity Checks.- Cryptography Based on Bilinear Maps.- The Merit Factor Problem for Binary Sequences.- Quantum Period Reconstruction of Binary Sequences.- The Vector Key Equation and Multisequence Shift Register Synthesis.- A General Framework for Applying FGLM Techniques to Linear Codes.- A Theory of Highly Nonlinear Functions.- The Solutions of the Third Power Sum Equation for Niho Type Decimations.- On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces.- Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points.- A Class of Fermat Curves for which Weil-Serre’s Bound Can Be Improved.- Nonbinary Quantum Codes from Hermitian Curves.- A Genetic Algorithm for Cocyclic Hadamard Matrices.- Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication.- A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI.- On Achieving Chosen Ciphertext Security with Decryption Errors.- Applying Fujisaki-Okamoto to Identity-Based Encryption.- A Short Random Fingerprinting Code Against a Small Number of Pirates.- A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation.- Traitor Tracing Against Powerful Attacks Using Combinatorial Designs.- New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems.- LDPC Codes for Fading Channels: Two Strategies.- Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping.- Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random Erasure Channels.- Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst ErasureChannels.- New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels.- Long Extended BCH Codes Are Spanned by Minimum Weight Words.- On the Feng-Rao Bound for Generalized Hamming Weights.- Nested Codes for Constrained Memory and for Dirty Paper.- Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM.- Hadamard Codes of Length 2 t s (s Odd). Rank and Kernel.


Best Sellers


Product Details
  • ISBN-13: 9783540314233
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 344
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings
  • Width: 155 mm
  • ISBN-10: 3540314237
  • Publisher Date: 03 Feb 2006
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Spine Width: 19 mm
  • Weight: 498 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
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)
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.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings(Theoretical Computer Science and General Issues)

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