Algebraic Shift Register Sequences
Home > Mathematics and Science Textbooks > Mathematics > Algebra > Algebraic Shift Register Sequences
Algebraic Shift Register Sequences

Algebraic Shift Register Sequences


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Pseudo-random sequences are essential ingredients of every modern digital communication system including cellular telephones, GPS, secure internet transactions and satellite imagery. Each application requires pseudo-random sequences with specific statistical properties. This book describes the design, mathematical analysis and implementation of pseudo-random sequences, particularly those generated by shift registers and related architectures such as feedback-with-carry shift registers. The earlier chapters may be used as a textbook in an advanced undergraduate mathematics course or a graduate electrical engineering course; the more advanced chapters provide a reference work for researchers in the field. Background material from algebra, beginning with elementary group theory, is provided in an appendix.

Table of Contents:
1. Introduction; Part I. Algebraically Defined Sequences: 2. Sequences; 3. Linear feedback shift registers and linear recurrences; 4. Feedback with carry shift registers and multiply with carry sequences; 5. Algebraic feedback shift registers; 6. d-FCSRs; 7. Galois mode, linear registers, and related circuits; Part II. Pseudo-Random and Pseudo-Noise Sequences: 8. Measures of pseudo-randomness; 9. Shift and add sequences; 10. M-sequences; 11. Related sequences and their correlations; 12. Maximal period function field sequences; 13. Maximal period FCSR sequences; 14. Maximal period d-FCSR sequences; Part III. Register Synthesis and Security Measures: 15. Register synthesis and LFSR synthesis; 16. FCSR synthesis; 17. AFSR synthesis; 18. Average and asymptotic behavior of security measures; Part IV. Algebraic Background: A. Abstract algebra; B. Fields; C. Finite local rings and Galois rings; D. Algebraic realizations of sequences; Bibliography; Index.

About the Author :
Mark Goresky is a member of the School of Mathematics at the Institute for Advanced Study in Princeton, New Jersey. Andrew M. Klapper received the A.B. degree in mathematics from New York University, New York, NY, in 1974, the M.S. degree in applied mathematics from SUNY, Binghamton, Binghamton, NY, in 1975, the M.S. degree in mathematics from Stanford University, Stanford, CA, in 1976 and the Ph.D. degree in mathematics from Brown University, Providence, RI, in 1982. His thesis, in the area of arithmetic geometry, concerned the existence of canonical subgroups in formal group laws. From 1981 to 1984 he was a postdoc in the Department of Mathematics and Computer Science at Clark University. From 1984 to 1991 he was an Assistant Professor in the College of Computer Science at Northeastern University. From 1991 to 1993 he was an Assistant Professor in the Computer Science Department at the University of Manitoba. Currently he is a Professor in the Department of Computer Science at the University of Kentucky. He was awarded a University Research Professorship for 2002–2003. His past research has included work on algebraic geometry over p-adic integer rings, computational geometry, modeling distributed systems, structural complexity theory and cryptography. His current interests include statistical properties of pseudo-random sequences based on abstract algebra, with applications in cryptography and CDMA and covering properties of codes. Dr Klapper is a member of the Information Theory Society and is a Senior Member of the IEEE. He was the general chair of Crypto '98 and of SETA 2008. He was the Associate Editor for Sequences for the IEEE Transactions on Information Theory from 1999 to 2002. He is currently an Associate Editor of the journals Applied Mathematics of Communications and Cryptography and Communications: Discrete Structures, Boolean Functions and Sequences.

Review :
"This book is a welcome addition to the personal library of anyone interested in pseudo-random sequences. It is, undoubtedly, a very serious monograph on this subject, which attempts to unify many types of sequence generators, using algebraic methods. The book is the fruit of a longtime collaboration on algebraic shift registers between its two authors. All in all, the book is rigorous but accessible and pleasantly written." Pantelimon Stanica, Mathematical Reviews "This elegant text casts highly practical mathematics as replete with miraculous theoretical novelties. It thus serves specialists while simultaneously envincing a broad appeal. Recommended." D.V. Feldman, Choice magazine


Best Sellers


Product Details
  • ISBN-13: 9781107014992
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Height: 258 mm
  • No of Pages: 514
  • Returnable: N
  • Returnable: N
  • Weight: 1110 gr
  • ISBN-10: 1107014999
  • Publisher Date: 02 Feb 2012
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Spine Width: 31 mm
  • Width: 178 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algebraic Shift Register Sequences
Cambridge University Press -
Algebraic Shift Register Sequences
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.

Algebraic Shift Register Sequences

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!