ShopSpell

Sequences II Methods in Communication, Security, and Computer Science [Paperback]

$42.99     $54.99    22% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • ISBN-10:  1461393256
  • ISBN-10:  1461393256
  • ISBN-13:  9781461393252
  • ISBN-13:  9781461393252
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  477
  • Pages:  477
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-2011
  • Pub Date:  01-Feb-2011
  • SKU:  1461393256-11-SPRI
  • SKU:  1461393256-11-SPRI
  • Item ID: 100882062
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 04 to Jul 06
  • Notes: Brand New Book. Order Now.
Communication.- On the Enumeration of Dyadic Distributions.- Detection of Skew in a Sequence of Subsets.- Asymmetric Error Correcting Codes.- Binary Perfect Weighted Coverings (PWC).- Read/Write Isolated Memory.- Polynomial-Time Construction of Linear Codes with Almost Equal Weights.- Welchs Bound and Sequence Sets for Code-Division Multiple-Access Systems.- Average-Case Interactive Communication.- Adaptive Lossless Data Compression Over a Noisy Channel.- Computer Science.- Parallel String Matching Algorithms.- Some Applications of Rabins Fingerprinting Method.- Periodic Prefixes in Texts.- Reconstructing Sequences from Shotgun Data.- A Systematic Design and Explanation of the Atrubin Multiplier.- On the Shannon Capacity of Graph Formulae.- An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.- Efficient Algorithms for Sequence Analysis.- Coding Trees as Strings for Approximate Tree Matching.- Deciding Code Related Properties by Means of Finite Transducers.- On the Derivation of Spline Bases.- Optimal Parallel Pattern Matching Through Randomization.- Approximate String-Matching and the q-gram Distance.- Universal Discrimination of Individual Sequences via Finite-State Classifiers.- Security.- Improving the Efficiency and Reliability of Digital Time-Stamping.- A Note on Secret Sharing Schemes.- Privacy of Dense Symmetric Functions.- Efficient Reduction among Oblivious Transfer Protocols Based on New Self-Intersecting Codes.- Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group.- Some Comments on the Computation of n-th Roots in Zn.- The Varieties of Secure Distributed Computation.- Fair Games Against an All-Powerful Adversary.- An Asymptotic Coding Theorem for Authentification and Secrecy.- Automata and Combinatorics on Words.- Gray Codes and Strongly Square-Free Strings.- A New Unavoidable Regularity in Free Monoids.- The Star Height One Problem for Irreducible Automata.- Synchronizing Automata.- Author Index.Springer Book Archives
Add Review