Sequences and their Applications
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and Theoretical Computer Science)
Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and Theoretical Computer Science)

Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and Theoretical Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

This volume contains the refereed proceedings of the International Conference on Sequences and Their Applications which was held at the River View Ho- tel in Singapore during December 14-17, 1998. The program of this conference was arranged by a committee consisting of Claude Carlet (University of Caen) , Agnes Chan (Northeastern University), Cunsheng Ding (National University of Singapore, co-chair), Dieter Gollmann (Microsoft Research), Tor Helleseth (Uni- versity of Bergen, co-chair), Kyoki Imamura (Kyushu Institute of Technology), Andrew Klapper (University of Kentucky), Vijay Kumar (University of Southern California), Siu Lun Ma (National University of Singapore), Harald Niederreiter (A ustrian Academy of Sciences, co-chair), Dilip Sarwate (University of Illinois at Urbana-Champaign), Hans Schotten (Aachen University of Technology), Jeffrey Shallit (University of Waterloo), Neil Sloane (AT&T Shannon Lab), and Aimo Tietiivajnen (University of Turku). The local organization was in the hands of Cunsheng Ding, Kwok Van Lam (chair), Sjauntele Lau, and Sew Kiok Toh, all of the National University of Singapore. The idea for the conference grew out of the recognition that sequences in discrete structures like the ring of integers, residue class rings of the integers, and finite fields have found many important applications in modern information and communication technologies. Among these applications we mention cryp- tographic schemes, ranging systems, spread spectrum communication systems, multi-terminal system identification, code-division mUltiple-access communica- tion systems, global positioning systems, software testing, circuit testing, and computer simulation. There are also connections between sequences in discrete structures and error-correcting codes.

Table of Contents:
Invited Contributions.- The Ubiquitous Prouhet-Thue-Morse Sequence.- On Ideal Autocorrelation Sequences Arising from Hyperovals.- Cyclic Hadamard Difference Sets — Constructions and Applications.- Correlation ofm-Sequences and Related Topics.- Some Computable Complexity Measures for Binary Sequences.- Meeting the Welch Bound with Equality.- My Favorite Integer Sequences.- Regular Contributions.- Complementary Interpolants and a Welch-Berlekamp-Style Algorithm.- Multiscale Coarse-Graining Invariant Sequences.- Regular Cosets and Upper Bounds on the Linear Complexity of Certain Sequences.- Hadamard Matrices, Self-Dual Codes over the Integers Modulo 4 and their Gray Images.- On Constructing Balanced Correlation Immune Functions.- On Bispecial Words and Subword Complexity of DOL Sequences.- On the Distribution of the RSA Generator.- Edit Probability Correlation Attack on the Alternating Step Generator.- Automaticity of Solutions of Mahler Equations.- Correlation Distribution of the Quaternary Kasami Sequences.- Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers.- Inclusion Relations of Boolean Functions Satisfying PC(l) of Orderk.- Notes onq-ary Interleaved Sequences.- A New Algorithm for the k-Error Linear Complexity of Sequences over GF (pm) with Period pn.- Sequences of I.I.D. Binary Random Variables Using Chaotic Dynamics.- Explicit Sequence Expansions.- Counting Functions and Expected Values in the Stability Theory of Stream Ciphers.- On-Line Constraint-Based Pattern Matching on Sequences.- On the Randomness of a [d,k]Self-Decimation Stream Key Generator.- Sequence Families with Optimum Aperiodic Mean-Square Correlation Parameters.- Period and Linear Complexity of Cascaded Clock-Controlled Generators.- Feedback with Carry ShiftRegisters over Z/(N).- Author Index.


Best Sellers


Product Details
  • ISBN-13: 9781852331962
  • Publisher: Springer London Ltd
  • Publisher Imprint: Springer London Ltd
  • Height: 235 mm
  • No of Pages: 395
  • Returnable: Y
  • Sub Title: Proceedings of SETA ’98
  • ISBN-10: 1852331968
  • Publisher Date: 17 Sep 1999
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Discrete Mathematics and Theoretical Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and Theoretical Computer Science)
Springer London Ltd -
Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and 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.

Sequences and their Applications: Proceedings of SETA ’98(Discrete Mathematics and 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!