
Algebraic Shift Register Sequences
$311.64
- Hardcover
514 pages
- Release Date
2 February 2012
Summary
Unlocking the Secrets of Pseudo-Random Sequences: Algebraic Shift Registers Explained
Pseudo-random sequences are the unsung heroes of modern digital communication, powering everything from cellular phones and GPS to secure internet transactions and satellite imagery. The demand for sequences with tailored statistical properties is ever-growing.
This book dives deep into the design, mathematical analysis, and practical implementation of these crucial sequences. With a strong…
Book Details
ISBN-13: | 9781107014992 |
---|---|
ISBN-10: | 1107014999 |
Author: | Mark Goresky, Andrew Klapper |
Publisher: | Cambridge University Press |
Imprint: | Cambridge University Press |
Format: | Hardcover |
Number of Pages: | 514 |
Release Date: | 2 February 2012 |
Weight: | 1.11kg |
Dimensions: | 258mm x 178mm x 31mm |
You Can Find This Book In
What They're Saying
Critics 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
About The Author
Mark Goresky
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.
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.