skip to content
Sequences ii : methods in communication, security, and computer science. Preview this item
ClosePreview this item

Sequences ii : methods in communication, security, and computer science.

Author: Anna Carey
Publisher: [Place of publication not identified] : Springer, 2012.
Edition/Format:   Print book : English

(not yet rated) 0 with reviews - Be the first.


Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Document Type: Book
All Authors / Contributors: Anna Carey
ISBN: 1461393256 9781461393252
OCLC Number: 802329203
Description: pages
Contents: 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.- Welch's 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 Rabin's 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.


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data

Primary Entity

<> # Sequences ii : methods in communication, security, and computer science.
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "802329203" ;
    library:placeOfPublication <> ; # Place of publication not identified
    schema:bookFormat bgn:PrintBook ;
    schema:creator <> ; # Anna Carey
    schema:datePublished "2012" ;
    schema:exampleOfWork <> ;
    schema:inLanguage "en" ;
    schema:name "Sequences ii : methods in communication, security, and computer science."@en ;
    schema:productID "802329203" ;
    schema:publication <> ;
    schema:publisher <> ; # Springer
    schema:workExample <> ;
    wdrs:describedby <> ;

Related Entities

<> # Anna Carey
    a schema:Person ;
    schema:familyName "Carey" ;
    schema:givenName "Anna" ;
    schema:name "Anna Carey" ;

<> # Place of publication not identified
    a schema:Place ;
    schema:name "Place of publication not identified" ;

    a schema:ProductModel ;
    schema:isbn "1461393256" ;
    schema:isbn "9781461393252" ;

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.